New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures

DOI10.1287/opre.37.4.542zbMath0677.90078OpenAlexW2038902712MaRDI QIDQ3833887

Fred Glover, Darwin D. Klingman

Publication date: 1989

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.37.4.542

zbMATH Keywords

sharpnesscomplexity boundpartitioning shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)

Related Items

A note on the partitioning shortest path algorithm