Mixing sets linked by bidirected paths

DOI10.1137/100811799MaRDI QIDQ3225243zbMATH OpenOpenAlexFDO

Authors Marco Di Summa, Laurence A. Wolsey

Publication date 16 March 2012

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4d2b4cffe94dbd64e862772f1dd971f33c744c05

zbMATH Keywords

convex hull descriptionslot-sizingmixed-integer programmingmixing sets

Mathematics Subject Classification ID

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

Recommendations

• The Mixing Set with Flows
• Network Formulations of Mixed-Integer Programs
• The Continuous Mixing Polyhedron
• The mixing-MIR set with divisible capacities
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows

Cited in

(12)

• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Convex hull results for generalizations of the constant capacity single node flow set
• Fixed-charge transportation on a path: optimization, LP formulations and separation
• A note on the continuous mixing set
• Fixed-charge transportation on a path: linear programming formulations
• Projecting an extended formulation for mixed-integer covers on bipartite graphs
• The Mixing Set with Flows
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
• The continuous knapsack set
• Compact formulations as a union of polyhedra
• The mixing-MIR set with divisible capacities

This page was built for publication: Mixing sets linked by bidirected paths

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