On a class of mixed-integer sets with a single integer variable

DOI10.1016/j.orl.2010.08.006zbMath1202.90198OpenAlexW2126110309MaRDI QIDQ614040

Marco Di Summa

Publication date: 23 December 2010

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

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

zbMATH Keywords

mixed-integer programmingconvex hull descriptionsnetwork-flow matrices

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

The splittable flow arc set with capacity and minimum load constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chvátal closures for mixed integer programming problems
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
• Network Formulations of Mixed-Integer Programs
• Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
• The Mixing Set with Flows
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
• The Continuous Mixing Polyhedron
• Mixing mixed-integer inequalities