Compact formulations as a union of polyhedra

DOI10.1007/S10107-007-0101-0MaRDI QIDQ927156zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Laurence A. Wolsey

Publication date 4 June 2008

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

Full work available at URL https://doi.org/10.1007/s10107-007-0101-0

zbMATH Keywords

Convex hullLot-sizingMixed integer setsUnions of polyhedra

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• A compact formulation of a mixed-integer set
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Mixing polyhedra with two non divisible coefficients
• Mixing sets linked by bidirected paths
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows

Cites work

• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• Approximate extended formulations
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• On the dimension of projected polyhedra
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Polyhedral description of the integer single node flow set with constant bounds
• Production Planning by Mixed Integer Programming
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Strong formulations of robust mixed 0-1 programming
• The Continuous Mixing Polyhedron
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
• The Mixing Set with Flows
• The Sequential Knapsack Polytope
• Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Valid Linear Inequalities for Fixed Charge Problems
• Valid inequalities for mixed integer linear programs

Cited in

(23)

• Polyhedral compactifications. I
• Single item lot-sizing with non-decreasing capacities
• Between steps: intermediate relaxations between big-M and convex hull formulations
• Extended formulations in combinatorial optimization
• Small and strong formulations for unions of convex sets from the Cayley embedding
• Valid inequalities for mixed integer linear programs
• Closed-form expressions for uniform polyhedra and their duals
• Mixing polyhedra with two non divisible coefficients
• Stable compactifications of polyhedra
• The mixing set with divisible capacities: a simple approach
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
• A geometric way to build strong mixed-integer programming formulations
• Extended formulations in combinatorial optimization
• Mixed integer linear programming formulation techniques
• Convex hull results for generalizations of the constant capacity single node flow set
• Covering linear programming with violations
• A compact formulation of a mixed-integer set
• On the minimum cut separator problem
• On mixing sets arising in chance-constrained programming
• The Mixing Set with Divisible Capacities
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Balas formulation for the union of polytopes is optimal

This page was built for publication: Compact formulations as a union of polyhedra

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