Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements

DOI10.1007/s11590-006-0030-5zbMath1220.90035MaRDI QIDQ2468776

Hanif D. Sherali, Mohamed Haouari, Mehdi Mrad

Publication date: 25 January 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-006-0030-5

zbMATH Keywords

network design; Benders decomposition; synthesis of capacitated networks

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90B80: Discrete location and assignment

Related Items

Benders decomposition approach for the robust network design problem with flow bifurcations, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, Optimal solution of the discrete cost multicommodity network design problem

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Discrete cost multicommodity network optimization problems and exact solution methods
• A survey on Benders decomposition applied to fixed-charge network design problems
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
• An Application of Generalized Linear Programming to Network Flows
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• Multicommodity Distribution System Design by Benders Decomposition
• The fixed charge problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points