scientific article

From MaRDI portal

Revision as of 08:08, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3688098

Jump to:navigation, search

zbMath0571.90059MaRDI QIDQ3688098

Nicos Christofides

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

scheduling vehicle routing relaxation travelling salesman assignment knapsack set partitioning delivery problem generalized matching binpacking minimal travel costs

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (22)

Vehicle routing with split deliveries ⋮ A heuristic solution to the warehouse location-routing problem ⋮ Linear time approximation schemes for vehicle scheduling problems ⋮ A robust strategy approach to a strategic mobility problem ⋮ Expected part delays as a secondary layout criterion in automated manufacturing systems ⋮ Models and exact solutions for a class of stochastic location-routing problems ⋮ A result on projection for the vehicle routing problem ⋮ Constrained TSP and low-power computing ⋮ 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. ⋮ Polyhedral results for a vehicle routing problem ⋮ On the vehicle routing problem ⋮ The vehicle routing problem: An overview of exact and approximate algorithms ⋮ Models, relaxations and exact approaches for the capacitated vehicle routing problem ⋮ A new heuristic for the fleet size and mix vehicle routing problem ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ A genetic algorithm for service level based vehicle scheduling ⋮ A new subtour elimination constraint for the vehicle routing problem ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ Integer linear programming formulation for a vehicle routing problem ⋮ Separating capacity constraints in the CVRP using tabu search

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3688098&oldid=17168111"