Polyhedral properties for the intersection of two knapsacks

DOI10.1007/S10107-006-0045-9zbMATH Open1226.90043OpenAlexW2022961086MaRDI QIDQ2476986FDOQ2476986

Authors: Quentin Louveaux, Robert Weismantel 

Publication date: 12 March 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://orbi.ulg.ac.be/handle/2268/1131

Recommendations

• scientific article; zbMATH DE number 1187156
• On the multiple integer knapsack polyhedra
• Description of 2-integer continuous knapsack polyhedra
• Knapsack polytopes: a survey
• On the facets of the mixed-integer knapsack polyhedron

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

• The 0-1 knapsack problem with a single continuous variable
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Mixing mixed-integer inequalities
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• On the \(0/1\) knapsack polytope
• Title not available (Why is that?)
• Partial cover and complete cover inequalities

Cited In (7)

• Title not available (Why is that?)
• Knapsack polytopes: a survey
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• On the facets of the mixed-integer knapsack polyhedron
• A knapsack intersection hierarchy
• The strength of multi-row aggregation cuts for sign-pattern integer programs
• On integer polytopes with few nonzero vertices

This page was built for publication: Polyhedral properties for the intersection of two knapsacks

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