메뉴 건너뛰기




Volumn 25, Issue 4, 1999, Pages 149-157

Computational results with a primal-dual subproblem simplex method

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATRIX ALGEBRA;

EID: 0033327703     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00048-6     Document Type: Article
Times cited : (26)

References (11)
  • 1
    • 0001779405 scopus 로고
    • A global approach to crew-pairing optimization
    • Anbil R., Tanga R., Johnson E.L. A global approach to crew-pairing optimization. IBM System J. 31:1992;71-78.
    • (1992) IBM System J. , vol.31 , pp. 71-78
    • Anbil, R.1    Tanga, R.2    Johnson, E.L.3
  • 3
    • 0026923017 scopus 로고
    • Very large-scale linear programming: A case study in combining interior point and simplex methods
    • R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten, D.F. Shanno, Very large-scale linear programming: a case study in combining interior point and simplex methods, Oper. Research 40 (1992) 885-897.
    • (1992) Oper. Research , vol.40 , pp. 885-897
    • Bixby, R.E.1    Gregory, J.W.2    Lustig, I.J.3    Marsten, R.E.4    Shanno, D.F.5
  • 6
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting-stock problem
    • Gilmore P.C., Gomory R.E. A linear programming approach to the cutting-stock problem. Oper. Res. 9:1961;849-859.
    • (1961) Oper. Res. , vol.9 , pp. 849-859
    • Gilmore, P.C.1    Gomory, R.E.2
  • 8
    • 0021446369 scopus 로고
    • The pivot and probe algorithm for solving a linear program
    • Sethi A., Thompson G. The pivot and probe algorithm for solving a linear program. Math. Programm. 29:1984;219-233.
    • (1984) Math. Programm. , vol.29 , pp. 219-233
    • Sethi, A.1    Thompson, G.2
  • 10
    • 0028433926 scopus 로고
    • Solving binary cutting stock problems by column generation and branch-and-bound
    • Vance P., Barnhart C., Johnson E.L., Nemhauser G.L. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3:1994;111-130.
    • (1994) Comput. Optim. Appl. , vol.3 , pp. 111-130
    • Vance, P.1    Barnhart, C.2    Johnson, E.L.3    Nemhauser, G.L.4
  • 11
    • 0031096922 scopus 로고    scopus 로고
    • Airline crew scheduling: A new formulation and decomposition algorithm
    • Vance P., Barnhart C., Johnson E.L., Nemhauser G.L. Airline crew scheduling. a new formulation and decomposition algorithm Oper. Res. 45(2):1997;188-200.
    • (1997) Oper. Res. , vol.45 , Issue.2 , pp. 188-200
    • Vance, P.1    Barnhart, C.2    Johnson, E.L.3    Nemhauser, G.L.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.