|
|
|
|
|
by xenity7
3402 days ago
|
|
I don't think this problem is as hard as you think it is in practical terms. N is going to be relatively small given basic constraints (the number of drivers and requests that could feasibly be matched is geographically limited). The search space for a request is limited to a few hundred drivers at most, competing with what is likely an even smaller pool of requests, making even extremely inefficient brute force approaches feasible. |
|