User menu

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

Bibliographic reference Van Vyve, Mathieu. Fixed-charge transportation on a path: optimization, LP formulations and separation. In: Mathematical Programming, Vol. 142, no.1-2, p. 371-395 (2013)
Permanent URL
  1. Aardal, K.: Capacitated facility location: separation algorithms and computational experience. Math. Program. A 81, 149–175 (1998)
  2. Akartunal, K., Miller, A.J.: A Computational analysis of lower bounds for big bucket production planning problems. Optimization. (2007)
  3. Carr, R., Fleischer, L., Leung, V., Phillips, C.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 106–115 (2000)
  4. Conforti Michele, Di Summa Marco, Eisenbrand Friedrich, Wolsey Laurence A., Network Formulations of Mixed-Integer Programs, 10.1287/moor.1080.0354
  5. Conforti Michele, Wolsey Laurence A., Zambelli Giacomo, Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs, 10.1287/moor.1100.0454
  6. Di Summa, M., Wolsey, L.A.: Mixing sets linked by bidirected paths. CORE Discussion Paper 2010/61, Louvain-la-Neuve (2010)
  7. Ghouila-Houri, A.: Caracterisation des matrices totalement unimodulaires. CR Acad. Sci. Paris 254, 1192–1194 (1962)
  8. Gu Zonghao, Nemhauser George L., Savelsbergh Martin W.P., Lifted flow cover inequalities for mixed 0-1 integer programs, 10.1007/s101070050067
  9. Jans Raf, Degraeve Zeger, Improved lower bounds for the capacitated lot sizing problem with setup times, 10.1016/j.orl.2003.06.001
  10. Krarup, J., Bilde, O.: Plant location, set covering and economic lotsizes: an $$O(mn)$$ algorithm for structured problems. In: Collatz, L. (ed.) Optimierung bei Graphentheoretischen und Ganzzahligen Probleme, pp. 155–180. Birkhauser Verlag, Basel (1977)
  11. Miller Andrew J., Nemhauser George L., Savelsbergh Martin W.P., On the polyhedral structure of a multi-item production planning model with setup times, 10.1007/s10107-002-0325-y
  12. Padberg M. W., Van Roy T. J., Wolsey L. A., Valid Linear Inequalities for Fixed Charge Problems, 10.1287/opre.33.4.842
  13. Trigeiro William W., Thomas L. Joseph, McClain John O., Capacitated Lot Sizing with Setup Times, 10.1287/mnsc.35.3.353
  14. Van Roy Tony J., Wolsey Laurence A., Solving Mixed Integer Programming Problems Using Automatic Reformulation, 10.1287/opre.35.1.45
  15. Vyve Mathieu Van, Wolsey Laurence A., Approximate extended formulations, 10.1007/s10107-005-0663-7
  16. Wolsey Laurence A., Submodularity and valid inequalities in capacitated fixed charge networks, 10.1016/0167-6377(89)90036-9