Cite
HARVARD Citation
Ogorodnikov, Y. et al. (2022). A Problem-Specific Branch-and-Bound Algorithm for the Protected Shortest Simple Path Problem with Must-Pass Nodes. IFAC-PapersOnLine. 55 (10), pp. 572-577. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Ogorodnikov, Y. et al. (2022). A Problem-Specific Branch-and-Bound Algorithm for the Protected Shortest Simple Path Problem with Must-Pass Nodes. IFAC-PapersOnLine. 55 (10), pp. 572-577. [Online].