Optimal Upgrading Schemes for Effective Shortest Paths in Networks

DOI10.1007/978-3-319-33954-2_29zbMath1479.90205OpenAlexW2461384559MaRDI QIDQ2815128

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck

Publication date: 27 June 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-33954-2_29

zbMATH Keywords

optimal path problem, branch-and-cut, Benders decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems

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