Network Formulations of Mixed-Integer Programs

DOI10.1287/MOOR.1080.0354MaRDI QIDQ3169026zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey

Publication date 27 April 2011

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1080.0354

zbMATH Keywords

compact extended formulationsmixed-integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3314878
• scientific article; zbMATH DE number 4149915
• Dual network bounds for integer programming problems of a special form
• Finding integer efficient solutions for multiple objective network programming problems
• scientific article; zbMATH DE number 738908
• A mixed-integer programming approach to networked control systems
• Finding a bounded mixed-integer solution to a system of dual network inequalities
• A method of network programming in problems of nonlinear optimization
• scientific article; zbMATH DE number 4053315

Cited in

(20)

• On matrices with the Edmonds-Johnson property arising from bidirected graphs
• Convex hull results for generalizations of the constant capacity single node flow set
• Mixed integer formulations for a routing problem with information collection in wireless networks
• Fixed-charge transportation on a path: optimization, LP formulations and separation
• A compact formulation of a mixed-integer set
• Fixed-charge transportation on a path: linear programming formulations
• Projecting an extended formulation for mixed-integer covers on bipartite graphs
• Mixing sets linked by bidirected paths
• The Mixing Set with Divisible Capacities
• scientific article; zbMATH DE number 4031396 (Why is no real title available?)
• Relaxations for two-level multi-item lot-sizing problems
• Lifting linear extension complexity bounds to the mixed-integer setting
• scientific article; zbMATH DE number 7559421 (Why is no real title available?)
• Extended formulations in combinatorial optimization
• Extended formulations in combinatorial optimization
• On a class of mixed-integer sets with a single integer variable
• Mixing polyhedra with two non divisible coefficients
• Separable convex mixed-integer optimization: improved algorithms and lower bounds
• Finding a bounded mixed-integer solution to a system of dual network inequalities
• On matrices with the Edmonds-Johnson property

This page was built for publication: Network Formulations of Mixed-Integer Programs

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