Routing a vehicle of capacity greater than one
From MaRDI portal
Publication:1382252
DOI10.1016/S0166-218X(97)00074-7zbMath0895.90084MaRDI QIDQ1382252
Publication date: 25 March 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
vehicle routing; graph algorithms; motion planning; NP-complete; satisfiability; limited capacity; feedback vertex set
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
90B06: Transportation, logistics and supply chain management
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Nonpreemptive Ensemble Motion Planning on a Tree
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Preemptive Ensemble Motion Planning on a Tree
- A Note on the Complexity of a Simple Transportation Problem
- The Complexity of Near-Optimal Graph Coloring