Pages that link to "Item:Q2672110"
From MaRDI portal
The following pages link to Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110):
Displaying 4 items.
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem (Q1626744) (← links)
- Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes (Q2669743) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems (Q6568503) (← links)