Abstract
The fixed-charge transportation problem is a fixed-charge network flow problem on a bipartite graph. This problem appears as a subproblem in many hard transportation problems, and has also strong links with the challenging big-bucket multi-item lot-sizing problem. We provide a polyhedral analysis of the polynomially solvable special case in which the associated bipartite graph is a path.
We describe a new class of inequalities that we call “path-modular” inequalities. We give two distinct proofs of their validity. The first one is direct and crucially relies on sub- and super-modularity of an associated set function, thereby providing an interesting link with flow-cover type inequalities. The second proof is by projecting a tight extended formulation, therefore also showing that these inequalities suffice to describe the convex hull of the feasible solutions to this problem. We finally show how to solve the separation problem associated to the path-modular inequalities in \(\mathcal{O}(n^3)\) time.
This paper presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming. The scientific responsibility is assumed by the author.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akartunal, K., Miller, A.J.: A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems (2007), Optimization Online, http://www.optimization-online.org/DB_FILE/2007/05/1668.pdf
Aardal, K.: Capacitated Facility Location: Separation Algorithms and Computational Experience. Mathematical Programming A 81, 149–175 (1998)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Inc., Englewood Cliffs (1993)
Conforti, M., Di Summa, M., Eisenbrand, F., Wolsey, L.A.: Network formulations of mixed-integer programs. Mathematics of Operations Research 34, 194–209 (2009)
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)
Conforti, M., Wolsey, L.A., Zambelli, G.: Projecting an extended formulation for mixed-integer covers on bipartite graphs. Mathematics of Operations Research 35, 603–623 (2010)
Di Summa, M., Wolsey, L.A.: Mixing sets linked by bidirected paths. CORE Discussion Paper 2010/61, Louvain-la-Neuve (2010)
Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming A 85, 439–467 (1999)
Jans, R., Degraeve, Z.: Improved lower bounds for the capacitated lot sizing problem with setup times. Operations Research Letters 32, 185–195 (2004)
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)
Padberg, M.W., van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Operations Research 33, 842–861 (1985)
van Roy, T.J., Wolsey, L.A.: Solving mixed integer programming problems using automatic reformulation. Operations Research 33, 45–57 (1987)
Van Vyve, M.: Fixed-charge transportation on a path: optimization, LP formulations and separation. CORE Discussion Paper 2010/68, Louvain-la-Neuve (2010)
Van Vyve, M., Wolsey, L.A.: Approximate extended formulations. Mathematical Programming B 105, 501–522 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Vyve, M. (2011). Fixed-Charge Transportation on a Path: Linear Programming Formulations. In: Günlük, O., Woeginger, G.J. (eds) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol 6655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20807-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-20807-2_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20806-5
Online ISBN: 978-3-642-20807-2
eBook Packages: Computer ScienceComputer Science (R0)