PR02-An Exact Algorithm for the Elmentary Shortest Path Problem with Resource Constraints
This week, I read the paper Lozano et al.(2016). The following are the reading notes. 1 Background The Elementary Shortest Path Problem with Resource Constraints (ESPPRC) is NP-hard in the strong sense and often arises as the backbone of the branch-and-price procedure. Ac- celerating the solution of the ESPPRC is a critical aspect for improving the performance of column-generation based algorithms. The ESPPRC has been widely studied, Desrochers et al. (1992) solved a relaxed version that allows cycles with a dynamic pro- gramming....