Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
type: Item
instance of: scholarly article
title: Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
zbMATH Open document ID: 1483.90128
author: Mohammad Rahim Akhavan Kazemzadeh
author: Tolga Bektaş
author: Teodor Gabriel Crainic
author: Antonio Frangioni
author: Bernard Gendron
author: E. Gorgone
published in: Discrete Applied Mathematics
publication date: 2022-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7452370
zbMATH Keywords: network design
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: column generation
zbMATH Keywords: matheuristic
MaRDI profile type: Publication
full work available at URL: j.dam.2020.12.024
OpenAlex ID: W3118724284
Wikidata QID: Q118165393
cites work: On the choice of explicit stabilizing terms in column generation
cites work: Flow pack facets of the single node fixed-charge flow polytope
cites work: Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design
cites work: Accelerating benders decomposition with heuristicmaster problem solutions
cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
cites work: Q3500141
cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design
cites work: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
cites work: A first multilevel cooperative algorithm for capacitated multicommodity network design
cites work: Benders decomposition without separability: a computational study for capacitated facility location problems
cites work: Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design
cites work: Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
cites work: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
cites work: Q4178782
cites work: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
cites work: A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem
cites work: Algorithms – ESA 2005
cites work: Algorithms for solving the single-sink fixed-charge transportation problem
cites work: A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
cites work: A local branching heuristic for the capacitated fixed-charge network design problem
cites work: Q4411416
DOI: 10.1016/J.DAM.2020.12.024
Recommended article: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Recommended article: Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Recommended article: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Recommended article: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
Recommended article: Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
Recommended article: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
Recommended article: Revisiting Lagrangian relaxation for network design
Recommended article: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
Recommended article: Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
Recommended article: A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
description: scientific article; zbMATH DE number 7452370