Skip to main content
SpringerLink
Log in

Integer Programming

  • Reference work entry
Encyclopedia of Optimization

  • 431 Accesses

Article Outline

Keywords

Scope and Applicability

Combinatorial Optimization

Solution Methods

The State of the Art

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Balas E (1965) An additive algorithm for solving linear programs with 0-1 variables. Oper Res 13:517–546

    MathSciNet  Google Scholar 

  2. Balas E (1979) Disjunctive programming. Ann Discret Math 5:3–51

    Article  MathSciNet  MATH  Google Scholar 

  3. Balas E (1998) Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl Math 89:1–44, Invited paper with a foreword by G. Cornuéjols and W.R. Pulleyblank. Originally MSRR 348 Carnegie-Mellon Univ., July 1974.

    Article  Google Scholar 

  4. Balas E, Ceria. S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math Program 58:295–324

    Article  Google Scholar 

  5. Balas E, Ceria. S, Cornuéjols G (1996) Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Managem Sci 42:1229–1246

    MATH  Google Scholar 

  6. Chvátal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discret Math 4:305–337

    Article  MATH  Google Scholar 

  7. Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley, New York

    Google Scholar 

  8. Edmonds J (1965) Maximum matching and a polyhedron with 0-1 vertices. J Res Nat Bureau Standards 69B:125–130

    MathSciNet  Google Scholar 

  9. Gomory R (1963) An algorithm for integer solutions to linear programs. In: Graves R, Wolfe P (eds) Recent Advances in Mathematical Programming. McGraw-Hill, New York, pp 269–302

    Google Scholar 

  10. Hoffman AJ, Kruskal JB (1956) Integral boundary points of convex polyhedra. In: Kuhn HW, Tucker AW (eds) Linear Inequalities and Related Systems. Princeton Univ. Press, Princeton, pp 223–246

    Google Scholar 

  11. Land AH, Doig AG (1960) An automatic method for solving discrete programming problems. Econometrica 28:497–520

    Article  MathSciNet  MATH  Google Scholar 

  12. Lawler EL Lenstra JK, Rinrooy Kan AHG, Shmoys DB (eds) (1985) The traveling salesman problem: A guided tour of combinatorial optimization. Wiley, New York

    MATH  Google Scholar 

  13. Lov´sz L, Schrijver A (1991) Cones of matrices and set functions and 0-1 optimization. SIAM J Optim 1:166–190

    Article  MathSciNet  Google Scholar 

  14. Nemhauser GL, Savelsbergh MWP, Sigismondi G (1994) MINTO, a mixed integer optimizer. Oper Res Lett 15:47–58

    Article  MathSciNet  MATH  Google Scholar 

  15. Nemhauser GL, Wolsey L (1988) Integer and combinatorial optimization. Wiley, New York

    MATH  Google Scholar 

  16. Parker G, Rardin R (1988) Discrete optimization. Acad. Press, New York

    MATH  Google Scholar 

  17. Schrijver A (1986) Theory of linear and integer programming. Wiley, New York

    MATH  Google Scholar 

  18. Sherali H, Adams W (1990) A hierarchy of relaxations between the continuous and convex hull presentations for 0-1 programming problems. SIAM J Discret Math 3:411–430

    Article  MathSciNet  MATH  Google Scholar 

  19. Thienel S (1995) ABACUS: a branch-and-cut system. PhD Thesis Dept. Computer Sci. Univ. Cologne

    Google Scholar 

  20. Wolsey L (1998) Integer programming. Wiley, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School Industrial Admin., Carnegie Mellon University, Pittsburgh, USA

    Egon Balas

Authors
  1. Egon Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Balas, E. (2008). Integer Programming . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_284

Download citation

Publish with us

Policies and ethics

Search

Navigation