Abstract
This chapter introduces problems and models that involve design decisions captured with arc-based binary variables that typically model fixed costs. We distinguish whether the demand can be represented as a single commodity or as multiple commodities, whether or not there are capacities, and whether or not there are variable transportation costs in the objective function, in addition to the fixed design costs. These characteristics yield different variants of network design problems and models, with various degrees of complexity. We identify a few basic modeling approaches in network design, including the use of path flow variables instead of arc flow variables, and the derivation of cut-set-based inequalities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Balakrishnan, A. (1987). LP extreme points and cuts for the fixed charge network design. Mathematical Programming, 39, 263–284.
Balakrishnan, A., Magnanti, T. L., & Mirchandani, P. (1997). Network design. In M. Dell’Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 311–334). New York: Wiley.
Balakrishnan, A., Magnanti, T. L., & Wong, R. (1989). A dual-ascent procedure for large-scale uncapacitated network design. Operations Research, 37(5), 716–740.
Balinski, M. L. (1961). Fixed-cost transportation problems. Naval Research Logistics, 8(1), 41–54.
Gendron, B., & Crainic, T. G. (1994). Relaxations for Multicommodity Capacitated Network Design Problems. Publication CRT-965, Centre for Research on Transportation, University of Montreal.
Gomory, R. E., & Hu, T. C. (1961). Multiterminal network flows. SIAM Journal of Applied Mathematics, 9, 551–570.
Hirsch, W. M., & Dantzig, G. B. (1968). The fixed charge problem. Naval Research Logistics, 15(3), 413–424.
Magnanti, T. L., & Wolsey, L. A. (1995). Optimal trees. In M. Ball, T. L. Magnanti, C. L. Monma, & G. L. Nemhauser (Eds.), Network models. Handbooks in Operations Research and Management Science (vol. 7, pp. 503–615). Amsterdam: North-Holland.
Magnanti, T. L., & Wong, R. T. (1984). Network design and transportation planning: Models and algorithms. Transportation Science, 18(1), 1–55.
Malek-Zavarei, M., & Frisch, I. T. (1972). On the fixed cost flow problem. International Journal of Control, 16(5), 897–902.
Minoux, M. (1989). Network synthesis and optimum network design problems: models, solution methods and applications. Networks, 19, 313–360.
Rardin, R. L., & Choe, U. (1979). Tighter Relaxations of Fixed Charge Network Flow Problems. Report J-79-18, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta.
Rardin, R. L., & Wolsey, L. A. (1993). Valid Inequalities and Projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. European Journal of Operational Research, 71, 95–109.
Wong, R. T. (1984). A dual ascent approach for steiner tree problems in a directed graph. Mathematical Programming, 28, 217–287.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s)
About this chapter
Cite this chapter
Crainic, T.G., Gendreau, M., Gendron, B. (2021). Fixed-Charge Network Design Problems. In: Crainic, T.G., Gendreau, M., Gendron, B. (eds) Network Design with Applications to Transportation and Logistics. Springer, Cham. https://doi.org/10.1007/978-3-030-64018-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-64018-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-64017-0
Online ISBN: 978-3-030-64018-7
eBook Packages: Business and ManagementBusiness and Management (R0)