Fixed-charge transportation on a path: optimization, LP formulations and separation

DOI10.1007/s10107-012-0583-2zbMath1286.68246OpenAlexW2136327794MaRDI QIDQ2434997

Mathieu Van Vyve

Publication date: 3 February 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0583-2

zbMATH Keywords

transportationconvex hullmixed-integer programminglot-sizingextended formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Fixed-charge transportation problems on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Submodularity and valid inequalities in capacitated fixed charge networks
• Capacitated facility location: Separation algorithms and computational experience
• On the polyhedral structure of a multi-item production planning model with setup times
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• 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