BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
branch-and-bound discrete-optimization combinatorial-optimization mixed-integer-programming shortest-path multi-agent-path-finding column-generation branch-and-cut-and-price branch-price-and-cut
-
Updated
Oct 4, 2024 - C++