A note on the continuous mixing set

DOI10.1016/J.ORL.2008.08.001MaRDI QIDQ2517804zbMATH OpenOpenAlexFDO

Authors Ming Zhao, I. R. jun. de Farias

Publication date 9 January 2009

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2008.08.001

zbMATH Keywords

branch-and-cutmixed-integer programmingpolyhedral combinatoricssimple mixed-integer set

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
• The Continuous Mixing Polyhedron
• The mixing-MIR set with divisible capacities
• The Mixing Set with Flows
• Mixing sets linked by bidirected paths

Cites work

• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Chvátal closures for mixed integer programming problems
• Disjunctive Programming
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Mixing mixed-integer inequalities
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• The Continuous Mixing Polyhedron
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
• The Mixing Set with Divisible Capacities
• The mixing-MIR set with divisible capacities
• Tight formulations for some simple mixed integer programs and convex objective integer programs

Cited in

(3)

• A polyhedral study on chance constrained program with random right-hand side
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows

This page was built for publication: A note on the continuous mixing set

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