Advertisement

A New Subadditive Approach to Integer Programming

  • Diego Klabjan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2337)

Abstract

The linear programming duality is well understood and the reduced cost of a column is frequently used in various algorithms. On the other hand, for integer programs it is not clear how to define a dual function even though the subadditive dual theory was developed a long time ago. In this work we propose a family of computationally tractable subadditive dual functions for integer programs. We develop a solution methodology that computes an optimal primal solution and an optimal subadditive dual function. We report computational results for set partitioning instances. To the best of our knowledge these are the first computational experiments on computing the optimal subadditive dual function.

Keywords

Valid Inequality Dual Objective Complementary Slackness Greedy Estimate Complementary Slackness Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anbil, R., Johnson, E., and Tanga, R. (1992). A global approach to crew pairing optimization. IBM Systems Journal, 31, 71–78.zbMATHCrossRefGoogle Scholar
  2. Balas, E. and Carrera, M. (1996). A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research, 44, 875–890.MathSciNetzbMATHCrossRefGoogle Scholar
  3. Borndorfer, R. (1998). A spects of Set Packing, Partitioning, and Covering. Ph.D. thesis, Technical University of Berlin.Google Scholar
  4. Burdet, C. and Johnson, E. (1977). A subadditive approach to solve integer programs. Annals of Discrete Mathematics, 1, 117–144.MathSciNetCrossRefGoogle Scholar
  5. CPLEX Optimization (1999). Using the CPLEX Callable Library. ILOG Inc., 6.5 edition.Google Scholar
  6. Eso, M. (1999). Parallel Branch and Cut for Set Partitioning. Ph.D. thesis, Cornell University.Google Scholar
  7. Hoffman, K. and Padberg, M. (1993). Solving airline crew scheduling problems by branch-and-cut. Management Science, 39, 657–682.zbMATHCrossRefGoogle Scholar
  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.Google Scholar
  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.MathSciNetzbMATHCrossRefGoogle Scholar
  12. Nemhauser, G. and Wolsey, L. (1988). Integer and combinatorial optimization. John Wiley & Sons.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Diego Klabjan
    • 1
  1. 1.University of Illinois at Urbana-ChampaignUrbana

Personalised recommendations