Experimental and Efficient Algorithms

DOI10.1007/b136461zbMath1121.90413OpenAlexW2485841483MaRDI QIDQ5710012

Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment, Time-dependent SHARC-routing, Shortest-path queries in static networks, Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments, Low-altitude aircraft routing, Engineering Route Planning Algorithms, Traffic Networks and Flows over Time, Car or Public Transport—Two Worlds, A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing, Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks, Unnamed Item