A branch and bound algorithm for the multiple depot vehicle scheduling problem.
Giorgio CarpanetoMauro Dell'AmicoMatteo FischettiPaolo TothPublished in: Networks (1989)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- np hard
- upper bound
- randomly generated
- search tree
- optimal solution
- randomly generated problems
- precedence constraints
- lower bounding
- combinatorial optimization
- max sat
- single machine scheduling problem
- search space
- finding an optimal solution
- np complete
- scheduling problem
- cost function
- neural network