Upgrading Shortest Paths in Networks

DOI10.1007/978-3-642-21311-3_9zbMath1302.90232OpenAlexW1591583224MaRDI QIDQ3003277

Bistra Dilkina, Katherine J. Lai, Carla P. Gomes

Publication date: 26 May 2011

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_9

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach ⋮ Upgrading nodes in tree-shaped hub location ⋮ Lagrangian and branch-and-cut approaches for upgrading spanning tree problems ⋮ Robust flows with losses and improvability in evacuation planning ⋮ Upgrading edges in the maximal covering location problem ⋮ Upgrading edges in the graphical TSP

This page was built for publication: Upgrading Shortest Paths in Networks