Benders, metric and cutset inequalities for multicommodity capacitated network design
From MaRDI portal
Publication:632387
DOI10.1007/s10589-007-9122-0zbMath1208.90026OpenAlexW2011612932MaRDI QIDQ632387
Alysson M. Costa, Jean-François Cordeau, Bernard Gendron
Publication date: 24 March 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9122-0
Benders decompositionmetric inequalitiescutset inequalitiesmulticommodity capacitated network design
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Exact approaches to the single-source network loading problem, Benders decomposition of the passive optical network design problem, Unsplittable non-additive capacitated network design using set functions polyhedra, A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow, Network loading problem: valid inequalities from 5- and higher partitions, A cutting plane algorithm for the capacitated connected facility location problem, From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints, Stabilizing branch‐and‐price for constrained tree problems, Benders decomposition approach for the robust network design problem with flow bifurcations, Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks, New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem, The transit time constrained fixed charge multi-commodity network design problem, Benders decomposition for network design covering problems, Design of survivable wireless backhaul networks with reliability considerations, The complexity of the timetable‐based railway network design problem, Solving survivable two-layer network design problems by metric inequalities, Accelerating benders decomposition with heuristicmaster problem solutions, Solving the optimum communication spanning tree problem, The Benders decomposition algorithm: a literature review, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, 0-1 reformulations of the multicommodity capacitated network design problem, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
Cites Work
- Unnamed Item
- Unnamed Item
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Partitioning procedures for solving mixed-variables programming problems
- Exact solution of multicommodity network optimization problems with general step cost functions
- A polyhedral approach to multicommodity survivable network design
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Network Design Using Cut Inequalities
- Algorithms – ESA 2005
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
