Continuous knapsack sets with divisible capacities

DOI10.1007/s10107-015-0868-3zbMath1333.90081OpenAlexW2118356472MaRDI QIDQ263180

Hande Yaman, Laurence A. Wolsey

Publication date: 4 April 2016

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

Full work available at URL: http://hdl.handle.net/11693/36928

zbMATH Keywords

convex hullcontinuous knapsack setdivisible capacitiespartition inequalitiessplittable flow arc set

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

Lifting for the integer knapsack cover polyhedron

Cites Work

• On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
• The convex hull of two core capacitated network design problems
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• A characterization of knapsacks with the max-flow--min-cut property
• The 0-1 knapsack problem with a single continuous variable
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• On the facets of the mixed-integer knapsack polyhedron
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• Description of 2-integer continuous knapsack polyhedra
• The cutting stock problem and integer rounding
• Graph Theory and Integer Programming
• The Sequential Knapsack Polytope
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• The continuous knapsack set
• Unnamed Item
• Unnamed Item