Shortest path auction algorithm without contractions using virtual source concept

DOI10.1023/A:1025750631443zbMath1043.90009OpenAlexW1511571834MaRDI QIDQ1415485

Raffaele Cerulli, Giancarlo Raiconi, Paola Festa

Publication date: 4 December 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025750631443

zbMATH Keywords

shortest pathauction techniquenetwork optimization

Mathematics Subject Classification ID

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

Related Items (3)

Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ On Some Special Network Flow Problems: The Shortest Path Tour Problems ⋮ An auction-based approach for the re-optimization shortest path tree problem

This page was built for publication: Shortest path auction algorithm without contractions using virtual source concept