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.
- Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) (← links)
- On the Bellman's principle of optimality (Q1619876) (← links)
- ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) (← links)
- The electric two-echelon vehicle routing problem (Q1634075) (← links)
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
- The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
- An open source spreadsheet solver for vehicle routing problems (Q1652315) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
- Adaptive large neighborhood search on the graphics processing unit (Q1711444) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← 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)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model (Q2087124) (← links)
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- Branch-and-price for a multi-attribute technician routing and scheduling problem (Q2226497) (← links)
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (Q2226503) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- A new heuristic for the fleet size and mix vehicle routing problem (Q2276859) (← links)
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
- Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
- Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
- Dynamic vehicle routing with time windows in theory and practice (Q2311301) (← links)
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem (Q2331412) (← links)
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
- An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← 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)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← 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)
