Skip to main content
SpringerLink
Log in

New results on equivalent integer programming formulations

  • Published:
Mathematical Programming Submit manuscript

Abstract

Methods are given for replacing a system of equations in nonnegative integer variables by a single equation with the same solution set. These results focus on easily specified coefficient conditions rather than on the use of bounds that must be calculated “externally” in order to produce the desired aggregation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Jac. M. Anthonisse, “A note on reducing a system to a single equation”, Mathematisch Centrum, BN 1/70 Amsterdam (December 1970).

    Google Scholar 

  2. G.H. Bradley, “Transformation of integer programs to knapsack problems”,Discrete Mathematics 1 (1971) 29–45.

    Google Scholar 

  3. G.H. Bradley, “Heuristic solution methods and transformed integer linear programming problems”, Yale Rept. No. 43 (March 1971).

  4. S.E. Elmagrahby and M.K. Wig, “On the treatment of stock cutting problems as diophantine programs”, O.P. Rept. No. 61, N.C. State University of Raleigh (May 1971).

  5. Fred Glover, “Accelerating the determination of the first facets of the octahedron”, MSRS 71-6, University of Colorado, Boulder, Colo. (September 1971).

    Google Scholar 

  6. Fred Glover and R.E. Woolsey, “Aggregating diophantine equations”,Zeitschrift fur Operations Research (1972) 1–10.

  7. K. Kendall and S. Zionts, “Solving integer programming problems by aggregating constraints”, paper presented at the Joint ORSA, TIMS and AIIE Meeting, Atlantic City, Nov. 1972.

  8. G.B. Mathews, “On the partition of numbers”,Proceedings of the London Mathematical Society 28 (1897).

  9. Manfred W. Padberg, “Equivalent knapsack-type formulations of bounded integer linear programs”, Management Sciences Research Rept. No. 227, Carnegie-Mellon University, Pittsburgh, Pa. (September 1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Colorado, Boulder, Colo., USA

    Fred Glover

Authors
  1. Fred Glover
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glover, F. New results on equivalent integer programming formulations. Mathematical Programming 8, 84–90 (1975). https://doi.org/10.1007/BF01580429

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580429

Keywords

Search

Navigation