The continuous knapsack set

DOI10.1007/s10107-015-0859-4zbMath1338.90273OpenAlexW2108782333MaRDI QIDQ5962725

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

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

mixed integer programmingpolyhedral combinatorics

Mathematics Subject Classification ID

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

Related Items (1)

Continuous knapsack sets with divisible capacities

Cites Work

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

This page was built for publication: The continuous knapsack set