The mixing set with divisible capacities: a simple approach

DOI10.1016/j.orl.2009.07.001zbMath1180.90184OpenAlexW2154859257MaRDI QIDQ1043241

Michele Conforti, Giacomo Zambelli

Publication date: 7 December 2009

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

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

zbMATH Keywords

dynamic programmingextended formulationsmixing setunimodular transformations

Mathematics Subject Classification ID

Linear programming (90C05) Dynamic programming (90C39)

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

Cites Work

• Unnamed Item
• The mixing-MIR set with divisible capacities
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• Extended Formulations for Packing and Partitioning Orbitopes
• Polyhedral Characterization of Discrete Dynamic Programming
• The Mixing Set with Divisible Capacities
• New Hardness Results for Diophantine Approximation
• Production Planning by Mixed Integer Programming
• Mixing mixed-integer inequalities