Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension.
Aditya JayaprakashMohammad R. SalavatipourPublished in: ACM Trans. Algorithms (2023)
Keyphrases
- bounded treewidth
- vehicle routing
- approximation schemes
- vehicle routing problem
- routing problem
- np complete
- np hard
- approximation algorithms
- decision problems
- travel time
- conjunctive queries
- benchmark problems
- column generation
- tabu search
- boolean functions
- metaheuristic
- shortest path
- special case
- traveling salesman problem
- fixed parameter tractable
- computational complexity
- combinatorial optimization
- numerical methods
- relational learning
- routing algorithm
- lower bound
- bounded degree
- query answering
- query evaluation
- optimal solution
- integrity constraints
- cellular automata
- constraint satisfaction problems
- particle swarm optimization
- simulated annealing
- data warehouse
- upper bound
- scheduling problem
- data model