Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding › Research Explorer

Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1080/10556788.2020.1817447
Final published version

Original language	English
Pages (from-to)	1128-1154
Number of pages	27
Journal	Optimization Methods and Software
Volume	36
Issue number	6
DOIs	https://doi.org/10.1080/10556788.2020.1817447
Publication status	Published - 2021

Research areas

brand-and-bound, dynamic programming, parallelism, Precedence constraints, sequential ordering problem, travelling salesman

WoS ResearchAreas Categories

Computer Science, Software Engineering
Operations Research & Management Science
Mathematics, Applied

ASJC Scopus subject areas

Software
Control and Optimization
Applied Mathematics

ID: 30381818