The Shortest Simple Path Problem with a Fixed Number of Must-Pass Nodes: A Problem-Specific Branch-and-Bound Algorithm.
Andrei KudriavtsevDaniel KhachayYuri OgorodnikovJie RenSheng Cheng ShaoDong ZhangMikhail Yu. KhachayPublished in: LION (2021)
Keyphrases
- fixed number
- branch and bound algorithm
- shortest path
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- path length
- search tree
- randomly generated problems
- lower bounding
- finite number
- mixed integer linear programming
- precedence constraints
- lagrangian relaxation
- finding an optimal solution
- neural network
- variable ordering
- worst case
- upper bounding