A branch-and-cut algorithm for capacitated network design problems
From MaRDI portal
Publication:1806022
DOI10.1007/S101070050077zbMATH Open1015.90090OpenAlexW2010440802MaRDI QIDQ1806022FDOQ1806022
Publication date: 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050077
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
- 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
mixed-integer programmingbranch-and-cut algorithmcapacitated network designnetwork loading problembi-directional edge capacitiescapacity expansion problemknapsack branchingpoint-to-point traffic demands
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)
Cited In (43)
- Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- 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
- MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Benders decomposition approach for the robust network design problem with flow bifurcations
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Multi-commodity variable upper bound flow models
- Robust network design: Formulations, valid inequalities, and computations
- A note on capacity models for network design
- Solving survivable two-layer network design problems by metric inequalities
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty
- Title not available (Why is that?)
- 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
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Title not available (Why is that?)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Multi-period traffic routing in satellite networks
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Algorithms – ESA 2005
- On capacitated network design cut-set polyhedra
- A polyhedral study of the capacity formulation of the multilayer network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- Title not available (Why is that?)
- 0-1 reformulations of the multicommodity capacitated network design problem
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling
- Title not available (Why is that?)
- An exact approach for the multicommodity network optimization problem with a step cost function
- Metric inequalities and the network loading problem
- A branch-and-cut to the point-to-point connection problem on multicast networks
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Separating tight metric inequalities by bilevel programming
- A branch-and-cut approach for minimum cost multi-level network design
- On cut-based inequalities for capacitated network design polyhedra
- Polyhedral structure of the 4-node network design problem
- Exact approaches to the single-source network loading problem
- The Steiner connectivity problem
Uses Software
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)
