Skip to main content
SpringerLink
Log in

Zero-Lifting for Integer Block Structured Problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This paper deals with the relations between the polyhedron described by the inequalities of a block structured problem and the polyhedra described by the inequalities of the single blocks. In particular, classes of block structured problems are described for which zero-lifting of facet inducing inequalities of a single block yields facet inducing inequalities for the whole problem. Some applications are discussed.

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

  • G. Cornuéjols and W. Pulleyblank, “A matching problem with side conditions,” Discrete Mathematics, vol. 29, pp. 135–159, 1980.

    Google Scholar 

  • C.E. Ferreira, A. Martin, and R. Weismantel, “Solving multiple knapsack problems by cutting planes,” SIAM Journal on Optimization, vol. 6, pp. 858–877, 1996.

    Google Scholar 

  • S. Fiorini and R.J. Wilson, Edge-Colourings of Graphs, vol. 16 of Research Notes in Mathematics, Pitman: London, 1977.

    Google Scholar 

  • E.S. Gottlieb and M.R. Rao, “The generalized assignment problem: Valid inequalities and facets,” Mathematical Programming, vol. 46, pp. 31–52, 1990.

    Google Scholar 

  • M. Grötschel, A. Martin, and R. Weismantel, “Packing steiner trees: Polyhedral investigations,” Mathematical Programming, vol. 72, pp. 101–124, 1996.

    Google Scholar 

  • I. Hoyler, “The NP-completeness of edge-coloring,” SIAM Journal on Computing, vol. 10, pp. 718–720, 1981.

    Google Scholar 

  • J. Krarup, “The peripatetic salesman problem and some related unsolved problems,” in Combinatorial Programming, Methods and Applications, B. Roy (Ed.), Reidel: Dordrecht, The Netherlands, 1975, pp. 173–178.

    Google Scholar 

  • A. Martin, “Integer programs with block structure,” Habilitationsshrift, Technische Universität Berlin, 1998.

  • G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Programming, Wiley: New York, 1988.

    Google Scholar 

  • M.W. Padberg, “Onthe facial structure of set packing polyhedra,” Mathematical Programming, vol. 5, pp. 199–215, 1973.

    Google Scholar 

  • L.A. Wolsey, “Facets and strong valid inequalities for integer programs,” Operations Research, vol. 24, pp. 367–372, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”, Viale Manzoni 30, 00185, Roma, Italy

    Giovanni Felici & Claudio Gentile

Authors
  1. Giovanni Felici
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claudio Gentile
    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

Felici, G., Gentile, C. Zero-Lifting for Integer Block Structured Problems. Journal of Combinatorial Optimization 7, 161–167 (2003). https://doi.org/10.1023/A:1024423013607

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024423013607

Search

Navigation