A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
type: Item
instance of: scholarly article
title: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
zbMATH Open document ID: 1062.90009
author: Teodor Gabriel Crainic
author: Bernard Gendron
author: Geneviéve Hernu
published in: Journal of Heuristics
publication date: 2005-04-07T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2153936
zbMATH Keywords: slope scaling
zbMATH Keywords: Lagrangean heuristic
zbMATH Keywords: multicommodity capacitated fixed-charge network design
MaRDI profile type: Publication
DOI: 10.1023/B:HEUR.0000045323.83583.BD
Recommended article: Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
Recommended article: Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
Recommended article: Q4782149
Recommended article: A capacity scaling heuristic for the multicommodity capacitated network design problem
Recommended article: MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
Recommended article: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Recommended article: Q3500141
Recommended article: Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Recommended article: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Recommended article: A dual ascent approach to the fixed-charge capacitated network design problem
description: scientific article; zbMATH DE number 2153936