Pages that link to "Item:Q3911683"
From MaRDI portal
The following pages link to Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683):
Displayed 50 items.
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
- Implementing an insertion heuristic for vehicle routing on parallel hardware (Q690016) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
- Incorporating inventory and routing costs in strategic location models (Q858450) (← links)
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- A column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Vehicle routing via column generation (Q1058983) (← links)
- Microcomputer-based algorithms for large scale shortest path problems (Q1072451) (← links)
- Implementation techniques for the vehicle routing problem (Q1086140) (← links)
- Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815) (← links)
- The vehicle routing problem with backhauls (Q1119178) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- Solving symmetric vehicle routing problems asymmetrically (Q1171005) (← links)
- The pickup and delivery problem with time windows (Q1179004) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- Topological design of ring networks (Q1318461) (← links)
- A heuristic solution to the warehouse location-routing problem (Q1331555) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926) (← links)
- Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
- A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
- Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) (← 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)
- Routing problems: A bibliography (Q1908308) (← links)
- A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem (Q1919781) (← links)
- A new heuristic for the fleet size and mix vehicle routing problem (Q2276859) (← links)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows (Q2367384) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem (Q2508207) (← links)
- Arc routing in a node routing environment (Q2571193) (← links)