Pages that link to "Item:Q2333147"
From MaRDI portal
The following pages link to An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147):
Displaying 6 items.
- The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
- On path ranking in time-dependent graphs (Q2669544) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows (Q6087498) (← links)
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← links)
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows (Q6200792) (← links)
