A new subadditive approach to integer programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2337 LNCS, Issue , 2002, Pages 384-400

  Klabjan, Diego ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; LINEAR PROGRAMMING;

COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; DUAL FUNCTION; INTEGER PROGRAM; LINEAR PROGRAMMING DUALITY; REDUCED COST; SET PARTITIONING; SOLUTION METHODOLOGY;

INTEGER PROGRAMMING;

EID: 33749633297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_27     Document Type: Conference Paper

References (12)

1. Anbil, R., Johnson, E., and Tanga, R. (1992). A global approach to crew pairing optimization. IBM Systems Journal, 31, 71-78.
2. Balas, E. and Carrera, M. (1996). A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research, 44, 875-890.
3. Borndorfer, R. (1998). Aspects of Set Packing, Partitioning, and Covering. Ph.D. thesis, Technical University of Berlin.
4. Burdet, C. and Johnson, E. (1977). A subadditive approach to solve integer programs. Annals of Discrete Mathematics, 1, 117-144.
5. CPLEX Optimization (1999). Using the CPLEX Callable Library. ILOG Inc., 6.5 edition.
6. Eso, M. (1999). Parallel Branch and Cut for Set Partitioning. Ph.D. thesis, Cornell University.
7. Hoffman, K. and Padberg, M. (1993). Solving airline crew scheduling problems by branch-and-cut. Management Science, 39, 657-682.
8. Johnson, E. (1973). Cyclic groups, cutting planes and shortest path. In T. Hu and S. Robinson, editors, Mathematical Programming, pages 185-211. Academic Press.
9. Klabjan, D. (2001a). A new subadditive approach to integer programming: Implementation and computational results. Technical report, University of Illinois at Urbana-Champaign. Available from http://www.staff.uiuc.edu/@klabjan/ professional.html.
10. Klabjan, D. (2001b). A new subadditive approach to integer programming: Theory and algorithms. Technical report, University of Illinois at Urbana-Champaign. Available from http://www.staff.uiuc.edu/@klabjan/ professional.html.
11. Llewellyn, D. and Ryan, J. (1993). A primal dual integer programming algorithm. Discrete Applied Mathematics, 45, 261-275.
12. Nemhauser, G. and Wolsey, L. (1988). Integer and combinatorial optimization. John Wiley & Sons.