Fixed-Charge Transportation on a Path: Linear Programming Formulations

DOI10.1007/978-3-642-20807-2_33zbMath1341.90019OpenAlexW2242676586MaRDI QIDQ3009780

Mathieu Van Vyve

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_33

zbMATH Keywords

transportationconvex hullmixed-integer programminglot-sizingextended formulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Capacitated facility location: Separation algorithms and computational experience
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• A computational analysis of lower bounds for big bucket production planning problems
• Approximate extended formulations
• Network Formulations of Mixed-Integer Programs
• Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
• Mixing Sets Linked by Bidirected Paths
• Valid Linear Inequalities for Fixed Charge Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

This page was built for publication: Fixed-Charge Transportation on a Path: Linear Programming Formulations