scientific article

zbMath0910.90223MaRDI QIDQ3840363

Robert Weismantel, Alexander Martin

Publication date: 10 August 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

strong cutting planesknapsack polyhedron

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Mixed integer programming (90C11)

Related Items

Knapsack polytopes: a survey ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ Polyhedral properties for the intersection of two knapsacks ⋮ Cutting planes in integer and mixed integer programming ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs