Benders, metric and cutset inequalities for multicommodity capacitated network design
From MaRDI portal
Publication:632387
DOI10.1007/S10589-007-9122-0zbMATH Open1208.90026OpenAlexW2011612932MaRDI QIDQ632387FDOQ632387
Authors: 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
Recommendations
- Benders decomposition for capacitated network design
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- On cut-based inequalities for capacitated network design polyhedra
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Benders decomposition for network design covering problems
- On capacitated network design cut-set polyhedra
- Tailoring Benders decomposition for uncapacitated network design
- scientific article; zbMATH DE number 1947445
- Approximating multi commodity network design on graphs of bounded pathwidth and bounded degree
Benders decompositionmetric inequalitiescutset inequalitiesmulticommodity capacitated network design
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On capacitated network design cut-set polyhedra
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Network Design Using Cut Inequalities
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Title not available (Why is that?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A polyhedral approach to multicommodity survivable network design
- A branch-and-cut algorithm for capacitated network design problems
- Exact solution of multicommodity network optimization problems with general step cost functions
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Title not available (Why is that?)
- Algorithms – ESA 2005
Cited In (27)
- Benders decomposition for network design covering problems
- Stabilizing branch-and-price for constrained tree problems
- Design of survivable wireless backhaul networks with reliability considerations
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- Solving the optimum communication spanning tree problem
- Benders decomposition approach for the robust network design problem with flow bifurcations
- The Benders decomposition algorithm: a literature review
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- Chance-constrained optimization of reliable fixed broadband wireless networks
- Accelerating Benders decomposition with heuristic master problem solutions
- Solving survivable two-layer network design problems by metric inequalities
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Network loading problem: valid inequalities from 5- and higher partitions
- A cutting plane algorithm for the capacitated connected facility location problem
- Benders decomposition of the passive optical network design problem
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- The complexity of the timetable‐based railway network design problem
- The transit time constrained fixed charge multi-commodity 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
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- 0-1 reformulations of the multicommodity capacitated network design problem
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Exact approaches to the single-source network loading problem
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
This page was built for publication: Benders, metric and cutset inequalities for multicommodity capacitated network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632387)
