← Back to Benchmarks
simmediumnavigationmetric · varies
APULSE: A Scalable Hybrid Algorithm for the RCSPP on Large-Scale Dense Graphs
Description
The resource-constrained shortest path problem (RCSPP) is a fundamental NP-hard optimization challenge with broad applications, from network routing to autonomous navigation. This problem involves finding a path that minimizes a primary cost subject to a budget on a secondary resource. While various RCSPP solvers exist, they often face critical scalability limitations when applied to the large, dense graphs characteristic of complex, real-world scenarios, making them impractical for time-critica