Partial cover and complete cover inequalities

DOI10.1016/0167-6377(94)90010-8zbMath0826.90092OpenAlexW2042428770MaRDI QIDQ1331885

Elena Fernández, Kurt O. Jørnsten

Publication date: 23 November 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90010-8

zbMATH Keywords

heuristicsknapsack constraintscover inequalities0-1 integer problems

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items (3)

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Polyhedral properties for the intersection of two knapsacks

Cites Work

• Heuristic algorithms for the multiple knapsack problem
• Solving Large-Scale Zero-One Linear Programming Problems
• Pivot and Complement–A Heuristic for 0-1 Programming
• Facets of the Knapsack Polytope From Minimal Covers
• Unnamed Item

This page was built for publication: Partial cover and complete cover inequalities