Cyclic group and knapsack facets

Julián Aráoz; Lisa A Miller; Ralph E. Gomory; Ellis L. Johnson

doi:10.1007/s10107-003-0390-x

Cyclic group and knapsack facets

Julián Aráoz, Lisa A Miller, Ralph E. Gomory, Ellis L. Johnson

Industrial and Systems Engineering

Research output: Contribution to journal › Article › peer-review

46 Scopus citations

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.

Original language	English (US)
Pages (from-to)	377-408
Number of pages	32
Journal	Mathematical Programming, Series B
Volume	96
Issue number	2
DOIs	https://doi.org/10.1007/s10107-003-0390-x
State	Published - May 1 2003

Access

10.1007/s10107-003-0390-x

OpenUrl availability

Full text

Cite this

@article{d00c06dac32e4d6b8f7a2d486de06f7d,

title = "Cyclic group and knapsack facets",

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.",

author = "Juli{\'a}n Ar{\'a}oz and Miller, {Lisa A} and Gomory, {Ralph E.} and Johnson, {Ellis L.}",

year = "2003",

month = may,

day = "1",

doi = "10.1007/s10107-003-0390-x",

language = "English (US)",

volume = "96",

pages = "377--408",

journal = "Mathematical Programming, Series B",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "2",

}

TY - JOUR

T1 - Cyclic group and knapsack facets

AU - Aráoz, Julián

AU - Miller, Lisa A

AU - Gomory, Ralph E.

AU - Johnson, Ellis L.

PY - 2003/5/1

Y1 - 2003/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=13944272157&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13944272157&partnerID=8YFLogxK

U2 - 10.1007/s10107-003-0390-x

DO - 10.1007/s10107-003-0390-x

M3 - Article

AN - SCOPUS:13944272157

SN - 0025-5610

VL - 96

SP - 377

EP - 408

JO - Mathematical Programming, Series B

JF - Mathematical Programming, Series B

IS - 2

ER -

Cyclic group and knapsack facets

Abstract

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this