@article{733caae305b8432eb18a4f9946becac7,
title = "Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding",
keywords = "brand-and-bound, dynamic programming, parallelism, Precedence constraints, sequential ordering problem, travelling salesman",
author = "Salii, {Yaroslav V.} and Sheka, {Andrey S.}",
note = "Publisher Copyright: {\textcopyright} 2020 Informa UK Limited, trading as Taylor & Francis Group.",
year = "2021",
doi = "10.1080/10556788.2020.1817447",
language = "English",
volume = "36",
pages = "1128--1154",
journal = "Optimization Methods and Software",
issn = "1055-6788",
publisher = "Taylor and Francis Ltd.",
number = "6",
}