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):
Displaying 50 items.
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms (Q257224) (← links)
- Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← 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 metaheuristic for stochastic service network design (Q707730) (← 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)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← 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)
