Bounds and heuristics for the shortest capacitated paths problem
From MaRDI portal
Publication:1850995
DOI10.1023/A:1015492014030zbMath1079.90171OpenAlexW1559267986MaRDI QIDQ1850995
Marie-Christine Costa, Michel Mittaz, Alain Hertz
Publication date: 15 December 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015492014030
Lagrangian relaxationtabu searchbandwidth packing problemminimum cost integer multicommodity flow problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (2)
The shortest multipaths problem in a capacitated dense channel ⋮ Minimal multicut and maximal integer multiflow: a survey
This page was built for publication: Bounds and heuristics for the shortest capacitated paths problem
