Bounds and heuristics for the shortest capacitated paths problem
type: Item
instance of: scholarly article
title: Bounds and heuristics for the shortest capacitated paths problem
zbMATH Open document ID: 1079.90171
DOI: 10.1023/A:1015492014030
author: Marie-Christine Costa
author: Alain Hertz
author: Michel Mittaz
published in: Journal of Heuristics
publication date: 2002-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1845394
zbMATH Keywords: minimum cost integer multicommodity flow problem
zbMATH Keywords: bandwidth packing problem
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: tabu search
MaRDI profile type: Publication
full work available at URL: a:1015492014030
OpenAlex ID: W1559267986
Recommended article: Bounds and Heuristics for Capacitated Routing Problems
Recommended article: Bounds for the general capacitated routing problem
Recommended article: A heuristic approach to hard constrained shortest path problems
Recommended article: Q5271454
Recommended article: The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
Recommended article: Q5323400
Recommended article: The Capacitated Arc Routing Problem: Lower bounds
Recommended article: Q5271455
Recommended article: A lower bound for the shortest path problem
Recommended article: Q4836312
description: scientific article; zbMATH DE number 1845394