Minimal equivalent binary knapsack inequalities

DOI10.1287/IJOC.1100.0408MaRDI QIDQ2899135zbMATH OpenOpenAlexFDO

Authors Gary J. Koehler

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1100.0408

zbMATH Keywords

computational complexityhard knapsack problemssubset sum

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On equivalent knapsack problems
• Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
• A solution method for a knapsack problem and its variant
• A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
• scientific article; zbMATH DE number 2032368

Cited in

(2)

• Polynomial size IP formulations of knapsack may require exponentially large coefficients
• scientific article; zbMATH DE number 2119958 (Why is no real title available?)

This page was built for publication: Minimal equivalent binary knapsack inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899135)