The Mixing Set with Divisible Capacities
From MaRDI portal
Publication:3503864
DOI10.1007/978-3-540-68891-4_30zbMath1143.90362OpenAlexW1682656435MaRDI QIDQ3503864
Marco Di Summa, Laurence A. Wolsey, Michele Conforti
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_30
Related Items
Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, Mixing MIR inequalities with two divisible coefficients, Mixing polyhedra with two non divisible coefficients, A compact formulation of a mixed-integer set, A note on the continuous mixing set, The mixing set with divisible capacities: a simple approach
Cites Work
- Unnamed Item
- Compact formulations as a union of polyhedra
- The mixing-MIR set with divisible capacities
- Mixing MIR inequalities with two divisible coefficients
- Disjunctive programming: Properties of the convex hull of feasible points
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Diophantine approximations and integer points of cones
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Strong formulations of robust mixed 0-1 programming
- Network Formulations of Mixed-Integer Programs
- The cutting stock problem and integer rounding
- The Sequential Knapsack Polytope
- Production Planning by Mixed Integer Programming
- Mixing mixed-integer inequalities
