Publication:3688098
From MaRDI portal
zbMath0571.90059MaRDI QIDQ3688098
Publication date: 1985
scheduling; vehicle routing; relaxation; travelling salesman; assignment; knapsack; set partitioning; delivery problem; generalized matching; binpacking; minimal travel costs
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
On the vehicle routing problem, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Integer linear programming formulation for a vehicle routing problem, Models and exact solutions for a class of stochastic location-routing problems, A result on projection for the vehicle routing problem, Polyhedral results for a vehicle routing problem, The vehicle routing problem: An overview of exact and approximate algorithms, A genetic algorithm for service level based vehicle scheduling, A new subtour elimination constraint for the vehicle routing problem, Vehicle routing with split deliveries, A heuristic solution to the warehouse location-routing problem, A robust strategy approach to a strategic mobility problem, Expected part delays as a secondary layout criterion in automated manufacturing systems, Graph theoretic relaxations of set covering and set partitioning problems, Solving a fuel delivery problem by heuristic and exact approaches., D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., Separating capacity constraints in the CVRP using tabu search, Stronger \(K\)-tree relaxations for the vehicle routing problem, Linear time approximation schemes for vehicle scheduling problems, A new heuristic for the fleet size and mix vehicle routing problem
