A lower bound for the quickest path problem.
Gianpaolo GhianiEmanuela GuerrieroPublished in: Comput. Oper. Res. (2014)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- shortest path
- lower and upper bounds
- branch and bound
- lower bounding
- objective function
- worst case
- genetic algorithm
- upper and lower bounds
- search space
- optimal solution
- neural network
- linear programming
- evolutionary algorithm
- endpoints
- search algorithm
- branch and bound method
- polynomial approximation