메뉴 건너뛰기
Operations Research
Volumn 46, Issue 3, 1998, Pages 316-329
Branch-and-price: Column generation for solving huge integer programs
Author keywords

Branch and bound; Decomposition algorithms; Integer programming
Indexed keywords

EID: 0000816725     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.3.316     Document Type: Article
Times cited : (1561)
References (10)
  • 1
    • 0001779405 scopus 로고
    • A global approach to crew-pairing optimization
    • ANBIL, R., R. TANGA, AND E. L. JOHNSON. 1992. A Global Approach to Crew-pairing Optimization. IBM Systems J. 31, 71-78.
    • (1992) IBM Systems J. , vol.31 , pp. 71-78
    • Anbil, R.1    Tanga, R.2    Johnson, E.L.3
  • 2
    • 0002938084 scopus 로고
    • A column generation algorithm for a ship scheduling problem
    • APPELGREN, L. H. 1969. A Column Generation Algorithm for a Ship Scheduling Problem. Transp. Sci, 3, 53-68.
    • (1969) Transp. Sci , vol.3 , pp. 53-68
    • Appelgren, L.H.1
  • 3
    • 0006138741 scopus 로고
    • An alternative formulation and solution strategy for multi-Commodity network flow problems
    • BARNHART, C., C. A. HANE, E. L. JOHNSON, AND G. SIGISMONDI. 1995. An Alternative Formulation and Solution Strategy for Multi-Commodity Network Flow Problems. Telecommunications Systems 3, 239-258.
    • (1995) Telecommunications Systems , vol.3 , pp. 239-258
    • Barnhart, C.1    Hane, C.A.2    Johnson, E.L.3    Sigismondi, G.4
  • 4
    • 0000638085 scopus 로고
    • Branch-and-price: Column generation for solving huge integer programs (abbreviated version)
    • J. R. Birge and K. G. Murty (eds.), Braun-Brumfield
    • BARNHART, C., E. L. JOHNSON, G. L. NEMHAUSER, M. W. P. SAVELSBERGH, AND P. VANCE. 1994. Branch-and-Price: Column Generation for Solving Huge Integer Programs (abbreviated version). Mathematical Programming, State of the Art. J. R. Birge and K. G. Murty (eds.), Braun-Brumfield, 186-207.
    • (1994) Mathematical Programming, State of the Art , pp. 186-207
    • Barnhart, C.1    Johnson, E.L.2    Nemhauser, G.L.3    Savelsbergh, M.W.P.4    Vance, P.5
  • 5
    • 0000076482 scopus 로고
    • Set partitioning: A survey
    • BALAS, E., AND M. PADBERG. 1976. Set Partitioning: A Survey. SIAM Review, 18, 710-760.
    • (1976) SIAM Review , vol.18 , pp. 710-760
    • Balas, E.1    Padberg, M.2
  • 6
    • 0026923017 scopus 로고
    • Very large-scale linear programming: A case study in combining interior point and simplex methods
    • BIXBY, R. E., J. W. GREGORY, I. J. LUSTIG, R. E. MARSTEN, AND D. F. SHANNO. 1992. Very Large-scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods. Opus. Res. 40, 885-897.
    • (1992) Opus. Res. , 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
  • 7
    • 0000377794 scopus 로고
    • Finding everett's lagrange multipliers by linear programming
    • BROOKS, R., AND A. GEOFFRION. 1966. Finding Everett's Lagrange Multipliers by Linear Programming. Opns. Res. 14, 1149-1153.
    • (1966) Opns. Res. , vol.14 , pp. 1149-1153
    • Brooks, R.1    Geoffrion, A.2
  • 10
    • 0030264417 scopus 로고    scopus 로고
    • An exact algorithm for IP column generation
    • VANDERBECK, F., AND L. A. WOLSEY. 1996. An Exact Algorithm for IP Column Generation. Opns. Res. Letters 19, 151-160.
    • (1996) Opns. Res. Letters , vol.19 , pp. 151-160
    • Vanderbeck, F.1    Wolsey, L.A.2

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