A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Matteo FischettiPaolo TothDaniele VigoPublished in: Oper. Res. (1994)
Keyphrases
- directed graph
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- random walk
- metaheuristic
- combinatorial optimization
- vehicle routing problem
- lower bounding
- precedence constraints
- np hard
- upper bounding
- single machine scheduling problem
- mixed integer linear programming
- randomly generated problems
- directed acyclic graph
- ant colony optimization
- neural network
- branch and bound method
- routing problem
- genetic algorithm
- lagrangian relaxation
- undirected graph
- graph structure
- max sat
- linear program
- evolutionary algorithm
- search algorithm
- feasible solution
- scheduling problem
- maximum clique