Skip to main content
SpringerLink
Log in

Aggregation of equalities in integer programming

  • Integer Programming
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 59))

  • 142 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anthonisse J.M. "A note on equivalent systems of linear diophantine equations", Operations Research 17 (1973) 167–177.

    Google Scholar 

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

    Google Scholar 

  3. Fayard D., Plateau G. "An algorithm for the solution of the 0–1 knapsack problem", Computing 28 (1982) 269–287.

    Google Scholar 

  4. Glover F. "New results on equivalent integer programming formulations", Mathematical Programming 8 (1975) 84–90.

    Google Scholar 

  5. Glover F., Woolsey R.E. "Aggregating diophantine equations", Zeitschrift für Operations Research (1972).

    Google Scholar 

  6. Guerch M.T. "La contraction d'équations diophantiennes", Doctorat de 3° cycle (1983).

    Google Scholar 

  7. Kaliszewski I., Libura M. "Constraints aggregation in integer programming" Report MPD 5-77, Systems Research Institute, Polish Academy of Sciences, Warszawa (Poland) (1977).

    Google Scholar 

  8. Kannan R."Polynomial-time aggregation of integer programming problems", Journal of the Association for Computing Machinery 30 (1983) 133–145.

    Google Scholar 

  9. Kendall K.E.,Zionts S.s`Solving integer programming problems by aggregating constraints", Operations Research 25 (1977) 346–351.

    Google Scholar 

  10. Mathews G.B. "On the partition of numbers", Proceedings of the London Mathematical Society 28 (1896) 486–490.

    Google Scholar 

  11. Meyer R.R. "Equivalent constraints for discrete sets", Discrete Applied Mathematics 1 (1979) 31–50.

    Google Scholar 

  12. Padberg M.W. "Equivalent knapsack-type formulations of bounded integer linear programs: an alternative approach", Naval Research Logistics Quarterly 19 (1972) 699–708.

    Google Scholar 

  13. Plateau G., Guerch M.T. "Aggregation of equalities in integer programming: a computational study", Publication ANO Lille (1983).

    Google Scholar 

  14. Rosenberg I.G. "Aggregation of equations in integer programming", Discrete Mathematics 10 (1974) 325–341.

    Google Scholar 

  15. Smith H.J.S. "On systems of linear indeterminate equations and congruences", Philosophical Transactions CLI (1861) 293–326.

    Google Scholar 

  16. Weinberg F. "A necessary and sufficient condition for aggregation of linear diophantine equations", IFOR — Studienberichte 4 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IEEA Informatique Bât M3, Université de Lille 1, 59655, Villeneuve d'Ascq Cedex, France

    G. Plateau & M. T. Guerch

Authors
  1. G. Plateau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. T. Guerch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Thoft-Christensen

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Plateau, G., Guerch, M.T. (1984). Aggregation of equalities in integer programming. In: Thoft-Christensen, P. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008890

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13185-4

  • Online ISBN: 978-3-540-38828-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation