Upgrading Shortest Paths in Networks

DOI10.1007/978-3-642-21311-3_9MaRDI QIDQ3003277zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Optimal upgrading schemes for effective shortest paths in networks
• Incremental network design with shortest paths
• Shortest-Path Routing in Arbitrary Networks
• scientific article; zbMATH DE number 1182917
• Computing optimal shortcuts for networks
• Computing optimal shortcuts for networks
• scientific article; zbMATH DE number 3880462
• Improved algorithms for dynamic shortest paths
• On finding and updating shortest paths distributively
• Upgrading arcs to minimize the maximum travel time in a network

Cited in

(12)

• scientific article; zbMATH DE number 1203392 (Why is no real title available?)
• Upgrading arcs to minimize the maximum travel time in a network
• Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
• Upgrading edge-disjoint paths in a ring
• Upgrading nodes in tree-shaped hub location
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
• Upgrading edges in the maximal covering location problem
• Best upgrade plans for large road networks
• Upgrading edges in the graphical TSP
• Optimal upgrading schemes for effective shortest paths in networks
• Robust flows with losses and improvability in evacuation planning
• The accessibility arc upgrading problem

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

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