The following pages link to (Q2861509):
Displaying 4 items.
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Approximating the minimum tour cover of a digraph (Q1736480) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
