Benders-and-cut algorithm for fixed-charge capacitated network design problem
From MaRDI portal
(Redirected from Publication:1582048)
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
Cites work
- scientific article; zbMATH DE number 9246 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3540635 (Why is no real title available?)
- A dual ascent approach to the fixed-charge capacitated network design problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Capacitated Network Design—Polyhedral Structure and Computation
- LP-based heuristic algorithms for interconnecting token rings via source routing bridges
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Tailoring Benders decomposition for uncapacitated network design
- Topological design of computer communication networks -- the overall design problem
Cited in
(22)- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Multiple allocation hub-and-spoke network design under hub congestion
- Memetic algorithms
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- Benders decomposition approach for the robust network design problem with flow bifurcations
- 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
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- 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
- A survey on Benders decomposition applied to fixed-charge network design problems
- Solution of preemptive multi-objective network design problems applying Benders decomposition method
- A new approach for solving the network problems
- Solving a capacitated hub location problem
- 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
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)
