Bounds and heuristics for the shortest capacitated paths problem

DOI10.1023/A:1015492014030MaRDI QIDQ1850995zbMATH OpenOpenAlexFDO

Authors Marie-Christine Costa, Alain Hertz, Michel Mittaz

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

zbMATH Keywords

bandwidth packing problemLagrangian relaxationminimum cost integer multicommodity flow problemtabu search

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Bounds and Heuristics for Capacitated Routing Problems
• Bounds for the general capacitated routing problem
• A heuristic approach to hard constrained shortest path problems
• The capacitated arc routing problem: heuristics
• The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
• The capacitated arc routing problem. A heuristic algorithm
• The Capacitated Arc Routing Problem: Lower bounds
• The capacitated arc routing problem: combinatorial lower bounds
• A lower bound for the shortest path problem
• scientific article; zbMATH DE number 764424

Cited in

(5)

• Bounds and Heuristics for Capacitated Routing Problems
• AI 2005: Advances in Artificial Intelligence
• A Heuristic Procedure For Path Location With Multisource Demand
• Minimal multicut and maximal integer multiflow: a survey
• The shortest multipaths problem in a capacitated dense channel

This page was built for publication: Bounds and heuristics for the shortest capacitated paths problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850995)