Pages that link to "Item:Q1652456"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456):
Displaying 11 items.
- Route-based approximate dynamic programming for dynamic pricing in attended home delivery (Q2023939) (← links)
- On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
- Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
- Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem (Q4995084) (← links)
- Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times (Q6106964) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
- Delay-resistant robust vehicle routing with heterogeneous time windows (Q6551164) (← links)
- Mathematical formulations for consistent travelling salesman problems (Q6555132) (← links)
- General VNS for asymmetric vehicle routing problem with time and capacity constraints (Q6568438) (← links)
- Consistent routing for local same-day delivery via micro-hubs (Q6581372) (← links)
- Multi-period time window assignment for attended home delivery (Q6586276) (← links)
