The following pages link to (Q3783827):
Displaying 32 items.
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- A dynamic logistics coordination model for evacuation and support in disaster response activities (Q864038) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
- The pickup and delivery problem with time windows (Q1179004) (← links)
- Practical aspects of route planning for magazine and newspaper wholesalers (Q1266509) (← links)
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
- A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- Towards a decision support system for the ready concrete distribution system: a case of a Greek company. (Q1412756) (← links)
- The dynamic vehicle rescheduling problem (Q1642794) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (Q2005939) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows (Q2367384) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- Arc routing in a node routing environment (Q2571193) (← links)
- Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
- A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector (Q2968486) (← links)
- Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
- Ant colony system for a VRP with multiple time windows and multiple visits (Q3511482) (← links)
- Length-constrained cycle partition with an application to UAV routing* (Q5058406) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
- A learn‐and‐construct framework for general mixed‐integer programming problems (Q6066679) (← links)
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
