A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2024 2representative citing papers
Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.
citing papers explorer
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
-
The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.