Benders-and-cut algorithm for fixed-charge capacitated network design problem
DOI10.1016/S0377-2217(99)00272-6zbMATH Open0967.90011OpenAlexW2081747522MaRDI QIDQ1582048FDOQ1582048
Authors: 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
Recommendations
- Benders decomposition for capacitated network design
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A branch-and-cut algorithm for capacitated network design problems
- Tailoring Benders decomposition for uncapacitated network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Integer programming (90C10) Decomposition methods (49M27)
Cites Work
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Title not available (Why is that?)
- A dual ascent approach to the fixed-charge capacitated network design problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Title not available (Why is that?)
- Capacitated Network Design—Polyhedral Structure and Computation
- Tailoring Benders decomposition for uncapacitated network design
- LP-based heuristic algorithms for interconnecting token rings via source routing bridges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topological design of computer communication networks -- the overall design problem
Cited In (22)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Memetic algorithms
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Multiple allocation hub-and-spoke network design under hub congestion
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- A Benders decomposition algorithm for base station planning problem in WCDMA networks
- A global optimization algorithm for reliable network design
- Benders decomposition: solving binary master problems by enumeration
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- A branch-and-cut algorithm for capacitated network design problems
- Scatter search for network design problem
- Exact solutions for the collaborative pickup and delivery problem
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion
- A survey on Benders decomposition applied to fixed-charge network design problems
- Solution of preemptive multi-objective network design problems applying Benders decomposition method
- Solving a capacitated hub location problem
- A new approach for solving the network problems
- Benders decomposition for capacitated network design
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- LP extreme points and cuts for the fixed-charge network design problem
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
Uses Software
This page was built for publication: Benders-and-cut algorithm for fixed-charge capacitated network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582048)
