Pages that link to "Item:Q4319751"
From MaRDI portal
The following pages link to Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees (Q4319751):
Displayed 46 items.
- 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)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
- A note on ``Coordination of production and distribution planning'' by P. Chandra and M. L. Fisher (Q856257) (← links)
- Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results (Q878563) (← links)
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- A GA based heuristic for the vehicle routing problem with multiple trips (Q928681) (← links)
- A mixed constrained (identical) vehicle routing problem for time minimisation (Q998682) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) (← links)
- A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach (Q1370717) (← links)
- Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. (Q1417560) (← links)
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms (Q1577779) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A cross-border transportation system under supply and demand constraints (Q1870842) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Probabilistic diversification and intensification in local search for vehicle routing (Q1922635) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length (Q2495966) (← links)
- A new tabu search algorithm for the vehicle routing problem with backhauls (Q2496076) (← links)
- COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM (Q3022133) (← links)
- A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows (Q3422371) (← links)
- Ant colony system for a VRP with multiple time windows and multiple visits (Q3511482) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)