An augmented Lagrangian algorithm for large scale multicommodity routing
type: Item
instance of: scholarly article
title: An augmented Lagrangian algorithm for large scale multicommodity routing
zbMATH Open document ID: 1044.90010
author: Torbjörn Larsson
author: Di Yuan
published in: Computational Optimization and Applications
publication date: 2004-03-15T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 2057464
zbMATH Keywords: multicommodity
zbMATH Keywords: augmented Lagrangian
zbMATH Keywords: routing
describes a project that uses: KORBX
describes a project that uses: PPRN
describes a project that uses: IPM
MaRDI profile type: Publication
full work available at URL: b:coap.0000008652.29295.eb
OpenAlex ID: W1972437117
DOI: 10.1023/B:COAP.0000008652.29295.EB
Recommended article: Dual-ascent methods for large-scale multicommodity flow problems
Recommended article: A scaling algorithm for multicommodity flow problems
Recommended article: Fast approximation algorithms for multicommodity flow problems
Recommended article: An efficient approach to optimization of semi‐stable routing in multicommodity flow networks
Recommended article: Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
Recommended article: The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time
Recommended article: A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
Recommended article: A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
Recommended article: Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
description: scientific article; zbMATH DE number 2057464