The continuous knapsack set

DOI10.1007/S10107-015-0859-4MaRDI QIDQ5962725zbMATH OpenOpenAlexFDO

Authors Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey

Publication date 23 February 2016

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

Full work available at URL https://doi.org/10.1007/s10107-015-0859-4

zbMATH Keywords

polyhedral combinatoricsmixed integer programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Recommendations

• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Sequence independent lifting for mixed integer programs with variable upper bounds
• The 0-1 knapsack problem with a single continuous variable
• Lifting for mixed integer programs with variable upper bounds
• Continuous knapsack sets with divisible capacities
• Network design arc set with variable upper bounds
• Polyhedral results on single node variable upper-bound flow models with allowed configurations
• Polyhedral description of the integer single node flow set with constant bounds
• Valid inequalities for problems with additive variable upper bounds
• Valid inequalities for the single arc design problem with set-ups

Cites work

• Description of 2-integer continuous knapsack polyhedra
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• Mixing sets linked by bidirected paths
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network design arc set with variable upper bounds
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• The convex hull of two core capacitated network design problems
• The splittable flow arc set with capacity and minimum load constraints

Cited in

(4)

• The continuous knapsack problem with capacities
• Relaxations of discrete sets with semicontinuous variables
• Continuous knapsack sets with divisible capacities
• Description of 2-integer continuous knapsack polyhedra

This page was built for publication: The continuous knapsack set

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