Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
From MaRDI portal
Publication:2064301
DOI10.1016/j.dam.2020.12.024zbMath1483.90128OpenAlexW3118724284WikidataQ118165393 ScholiaQ118165393MaRDI QIDQ2064301
Bernard Gendron, Tolga Bektaş, Enrico Gorgone, Antonio Frangioni, Teodor Gabriel Crainic, Mohammad Rahim Akhavan Kazemzadeh
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.12.024
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- On the choice of explicit stabilizing terms in column generation
- A local branching heuristic for the capacitated fixed-charge network design problem
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Algorithms for solving the single-sink fixed-charge transportation problem
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Accelerating benders decomposition with heuristicmaster problem solutions
- Algorithms – ESA 2005
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Flow pack facets of the single node fixed-charge flow polytope
