The following pages link to (Q4103312):
Displaying 20 items.
- New inapproximability bounds for TSP (Q494069) (← links)
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- Strategies for parallel unaware cleaners (Q896136) (← links)
- A modular algorithm for an extended vehicle scheduling problem (Q1162919) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
- A genetic algorithm for a green vehicle routing problem (Q1742204) (← links)
- On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
- Neural large neighborhood search for routing problems (Q2093389) (← links)
- Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- (Q5075801) (← links)
- A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times (Q5232502) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- Modeling and algorithmic development of a staff scheduling problem (Q5925863) (← links)
- A theoretical and computational study of green vehicle routing problems (Q6173935) (← links)
- Solving a multiobjective professional timetabling problem using evolutionary algorithms at Mandarine Academy (Q6609713) (← links)
