The following pages link to (Q3751354):
Displaying 45 items.
- The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution (Q684320) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry (Q807381) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- Solving the truck and trailer routing problem based on a simulated annealing heuristic (Q959516) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Models and exact solutions for a class of stochastic location-routing problems (Q1123112) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- The pickup and delivery problem with time windows (Q1179004) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- Practical aspects of route planning for magazine and newspaper wholesalers (Q1266509) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- A real delivery problem dealt with Monte Carlo techniques (Q1592629) (← links)
- A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost (Q1665650) (← links)
- Modeling of multi depot vehicle routing problem for petroleum products (Q1682817) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- A new heuristic for the fleet size and mix vehicle routing problem (Q2276859) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
- Incorporating vehicle into the vehicle routing fleet composition problem (Q2367383) (← links)
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
- Heuristics for the lexicographic Max-ordering vehicle routing problem (Q2461267) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Linear temporal logic vehicle routing with applications to multi-UAV mission planning (Q2903986) (← links)
- The ALGACEA‐1 method for the capacitated vehicle routing problem (Q3638856) (← links)
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
- Combinatorial optimization and green logistics (Q5900891) (← links)
- Combinatorial optimization and green logistics (Q5925286) (← links)
- Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
- The road train optimization problem with load assignment (Q6164384) (← links)
- An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows (Q6572891) (← links)
