A branch-and-cut algorithm for capacitated network design problems
From MaRDI portal
Publication:1806022
Recommendations
- A branch and cut algorithm for the hierarchical network design problem
- scientific article; zbMATH DE number 1670539
- Approximation algorithms for a capacitated network design problem
- scientific article; zbMATH DE number 1264406
- scientific article; zbMATH DE number 1187079
- A branch‐and‐cut algorithm for hub network design problems with profits
- Branch and cut methods for network optimization
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
Cited in
(46)- scientific article; zbMATH DE number 1187079 (Why is no real title available?)
- scientific article; zbMATH DE number 1947445 (Why is no real title available?)
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Algorithms – ESA 2005
- Multi-period traffic routing in satellite networks
- Polyhedral structure of the 4-node network design problem
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Generalized local branching heuristics and the capacitated ring tree problem
- Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
- Robust network design: formulations, valid inequalities, and computations
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- A branch-and-cut approach for minimum cost multi-level network design
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A polyhedral study of the capacity formulation of the multilayer network design problem
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Branch-and-cut methods for the network design problem with vulnerability constraints
- Network loading problem: valid inequalities from 5- and higher partitions
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- scientific article; zbMATH DE number 151869 (Why is no real title available?)
- Metric inequalities and the network loading problem
- Models and algorithms for network design problems
- On cut-based inequalities for capacitated network design polyhedra
- Exact approaches to the single-source network loading problem
- Separating tight metric inequalities by bilevel programming
- On capacitated network design cut-set polyhedra
- The Steiner connectivity problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- A note on capacity models for network design
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- scientific article; zbMATH DE number 1187076 (Why is no real title available?)
- An exact approach for the multicommodity network optimization problem with a step cost function
- Diversification strategies in local search for a nonbifurcated network loading problem
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Network design problem with cut constraints
- Network models with unsplittable node flows with application to unit train scheduling
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Solving survivable two-layer network design problems by metric inequalities
- Multi-commodity variable upper bound flow models
- A branch-and-cut to the point-to-point connection problem on multicast networks
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Benders decomposition approach for the robust network design problem with flow bifurcations
This page was built for publication: A branch-and-cut algorithm for capacitated network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806022)
