Skip to main content
SpringerLink
Log in
Book cover

Optimization Techniques pp 154–159Cite as

Alternative group relaxation of integer programming problems

  • Integer Programming
  • Conference paper
  • First Online:

  • 169 Accesses

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

Abstract

The classical group approach to integer linear programming problems (IP) can be generalized in order to obtain group minimization problems with different computational load and different relaxation.

The aim of this work is to analyze some group problems, associated to the same (IP), both from the point of view of the relaxation of the (IP) and of the complexity of the group solution algorithm; evaluation criteria for these group problems are pointed out.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. DER-SAN CHEN, ZIONTS: Comparison of some algorithms for solving the Group Theoretic Integer Programming Problem. Operations Research, vol. 24, n.6. Nov–Dec. 1976.

    Google Scholar 

  2. J.F. SHAPIRO: Group theoretic algorithms for the integer programming problem II: extension to a general algorithm — Operations Research, vol. 16, pp.928–947, 1968.

    Google Scholar 

  3. G.A.GORRY, J.F.SHAPIRO: An adaptive group theoretic algorithm for integer programming problems. Management Science vol. 17 n. 5 Gen. 1971.

    Google Scholar 

  4. J.F. SHAPIRO: Dynamic programming algorithms for the integer programming problem I: the integer programming problem as a knapsack type problem. Operations Research vol. 16, pp. 103–121, 1968.

    Google Scholar 

  5. D.E.BELL: Constructive group relaxation for integer programs. Siam Journal on Applied Mathematics, vol. 30, n. 4, June 1976.

    Google Scholar 

  6. G.A.GORRY, J.F.SHAPIRO, L.A.WOLSEY: Relaxation methods for pure and mixed integer programming problems. Management Science vol. 18, n. 5, Jan. 1972.

    Google Scholar 

  7. R.JEROSLOW: Cutting plane theory: algebraic methods. Discrete Mathematics, vol. 23, n. 2, Aug. 1978.

    Google Scholar 

  8. E.V.DENARDO, B.L.FOX: "Shortest Route Methods: 1. Reaching, Pruning and Buckets" Op. Res., Jan. 1979.

    Google Scholar 

  9. E.V.DENARDO, B.L.FOX: "Shortest Route Methods: 2. Group knapsacks, Expanded Networks and branch and bound" Univ. of Montreal, Pub. 263-2, March 1978.

    Google Scholar 

  10. H.M.SALKIN: "Integer programming" Addition Wesley 1975.

    Google Scholar 

  11. F.R.GANTMACHER: "The theory of matrices" Chelsea Pub. Comp. 1959.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto of Automatica and CSSCCA of C.N.R., Via Eudossiana 18, 00184, Roma, Italy

    P. Bertolazzi, C. Leporelli & M. Lucertini

Authors
  1. P. Bertolazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Leporelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Lucertini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Iracki K. Malanowski S. Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Bertolazzi, P., Leporelli, C., Lucertini, M. (1980). Alternative group relaxation of integer programming problems. In: Iracki, K., Malanowski, K., Walukiewicz, S. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006599

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10081-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation