Continuous knapsack sets with divisible capacities
From MaRDI portal
Recommendations
- The continuous knapsack set
- A polyhedral study of the semi-continuous knapsack problem
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Relaxations of discrete sets with semicontinuous variables
- Description of 2-integer continuous knapsack polyhedra
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A characterization of knapsacks with the max-flow--min-cut property
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Description of 2-integer continuous knapsack polyhedra
- Graph Theory and Integer Programming
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the facets of the mixed-integer knapsack polyhedron
- The 0-1 knapsack problem with a single continuous variable
- The Sequential Knapsack Polytope
- The continuous knapsack set
- The convex hull of two core capacitated network design problems
- The cutting stock problem and integer rounding
Cited in
(3)
This page was built for publication: Continuous knapsack sets with divisible capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263180)
