Cite
HARVARD Citation
Salii, Y. et al. (2021). Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding. Optimization methods and software. pp. 1128-1154. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Salii, Y. et al. (2021). Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding. Optimization methods and software. pp. 1128-1154. [Online].