Benders-and-cut algorithm for fixed-charge capacitated network design problem

DOI10.1016/S0377-2217(99)00272-6zbMath0967.90011OpenAlexW2081747522MaRDI QIDQ1582048

Varadharajan Sridhar, June S. Park

Publication date: 3 September 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00272-6

zbMATH Keywords

integer programmingbranch and boundnetwork designBenders decompositiontelecommunication

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Decomposition methods (49M27)

Related Items

Multiple allocation hub-and-spoke network design under hub congestion, A global optimization algorithm for reliable network design, Solving a capacitated hub location problem, A Benders decomposition algorithm for base station planning problem in WCDMA networks, From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints, Benders decomposition approach for the robust network design problem with flow bifurcations, Solution of preemptive multi-objective network design problems applying Benders decomposition method, A new approach for solving the network problems, A survey on Benders decomposition applied to fixed-charge network design problems, Benders decomposition: solving binary master problems by enumeration, Exact solutions for the collaborative pickup and delivery problem, Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Memetic algorithms, Scatter search for network design problem

Uses Software

• OSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LP-based heuristic algorithms for interconnecting token rings via source routing bridges
• Topological design of computer communication networks -- the overall design problem
• A dual ascent approach to the fixed-charge capacitated network design problem
• Tailoring Benders decomposition for uncapacitated network design
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Capacitated Network Design—Polyhedral Structure and Computation