Fixed-charge transportation problems on trees
From MaRDI portal
Publication:1728231
DOI10.1016/j.orl.2017.04.001zbMath1409.90030arXiv1511.08179OpenAlexW2964056523MaRDI QIDQ1728231
Gustavo Angulo, Mathieu Van Vyve
Publication date: 22 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08179
dynamic programmingfixed-charge transportation problempseudo-polynomial extended formulationsingle-node flow polytope
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)
Related Items
Binary extended formulations of polyhedral mixed-integer sets ⋮ An uncertain two-echelon fixed charge transportation problem
Cites Work
- Unnamed Item
- Cutting planes from extended LP formulations
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Polyhedral Characterization of Discrete Dynamic Programming
- Valid Linear Inequalities for Fixed Charge Problems
- Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
- Solving Mixed Integer Programming Problems Using Automatic Reformulation