Continuous knapsack sets with divisible capacities
From MaRDI portal
Publication:263180
DOI10.1007/S10107-015-0868-3zbMATH Open1333.90081OpenAlexW2118356472MaRDI QIDQ263180FDOQ263180
Authors: Laurence A. Wolsey, Hande Yaman 
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- The Sequential Knapsack Polytope
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- The continuous knapsack set
- The convex hull of two core capacitated network design problems
- Convex hulls of superincreasing knapsacks and lexicographic orderings
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)
