Skip to main content
SpringerLink
Log in

Cyclic group and knapsack facets

  • Published:
Mathematical Programming Submit manuscript

Abstract.

 Any integer program may be relaxed to a group problem. We define the master cyclic group problem and several master knapsack problems, show the relationship between the problems, and give several classes of facet-defining inequalities for each problem, as well as a set of mappings that take facets from one type of master polyhedra to another.

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

Author information

Authors and Affiliations

  1. Universidad Simón Bolívar, Caracas, Venezuela, , , , , , VE

    Julián Aráoz

  2. Georgia Institute of Technology, Atlanta, Georgia, USA, , , , , , US

    Lisa Evans & Ellis L. Johnson

  3. Sloan Foundation, New York, NY, USA, , , , , , US

    Ralph E. Gomory

Authors
  1. Julián Aráoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lisa Evans
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ralph E. Gomory
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ellis L. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: May 24, 2001 / Accepted: August 2002 Published online: March 21, 2003

Mathematics Subject Classification (1991): 20E28, 20G40, 20C20

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aráoz, J., Evans, L., Gomory, R. et al. Cyclic group and knapsack facets. Math. Program., Ser. B 96, 377–408 (2003). https://doi.org/10.1007/s10107-003-0390-x

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0390-x

Keywords

Search

Navigation