scientific article; zbMATH DE number 3912104
From MaRDI portal
Publication:3688098
zbMATH Open0571.90059MaRDI QIDQ3688098FDOQ3688098
Authors: Nicos Christofides 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
schedulingassignmentrelaxationvehicle routingknapsackset partitioningtravelling salesmandelivery problemgeneralized matchingbinpackingminimal travel costs
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10)
Cited In (44)
- On the vehicle routing problem
- Graph theoretic relaxations of set covering and set partitioning problems
- What you should know about the vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Routing a vehicle of capacity greater than one
- Vehicle routing with subtours
- A genetic algorithm for service level based vehicle scheduling
- Models and exact solutions for a class of stochastic location-routing problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- A heuristic solution to the warehouse location-routing problem
- The vehicle routing problem with demand range
- Vehicle routing with full loads
- Title not available (Why is that?)
- Industrial Vehicle Routing
- A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem
- Title not available (Why is that?)
- Integer linear programming formulation for a vehicle routing problem
- Ten years of Routist: vehicle routing lessons learned from practice
- Linear time approximation schemes for vehicle scheduling problems
- A new subtour elimination constraint for the vehicle routing problem
- New notation and classification scheme for vehicle routing problems
- Editorial: Integrated vehicle routing problems
- Algorithms and Data Structures
- A result on projection for the vehicle routing problem
- The vehicle routing problem
- Vehicle routing with split deliveries
- Solving a fuel delivery problem by heuristic and exact approaches.
- A robust strategy approach to a strategic mobility problem
- A TSSP+1 decomposition strategy for the vehicle routing problem
- Separating capacity constraints in the CVRP using tabu search
- Title not available (Why is that?)
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- Constrained TSP and low-power computing
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm
- Title not available (Why is that?)
- Vehicle routing for small package delivery and pickup services
- A new variant of a vehicle routing problem: Lower and upper bounds
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- Polyhedral results for a vehicle routing problem
- Title not available (Why is that?)
- Expected part delays as a secondary layout criterion in automated manufacturing systems
- A new heuristic for the fleet size and mix vehicle routing problem
- Projection results for vehicle routing
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688098)
