Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem › Research Explorer

Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

DOI

https://doi.org/10.1007/978-3-030-91059-4_10
Final published version

Original language	English
Title of host publication	Optimization and Applications - 12th International Conference, OPTIMA 2021, Proceedings
Editors	Nicholas N. Olenev, Yuri G. Evtushenko, Milojica Jaćimović, Michael Khachay, Vlasta Malkova
Publisher	Springer
Pages	136-148
Number of pages	13
ISBN (Print)	9783030910587
DOIs	https://doi.org/10.1007/978-3-030-91059-4_10
Publication status	Published - 2021
Event	12th International Conference on Optimization and Applications, OPTIMA 2021 - Virtual, Online Duration: 27 Sept 2021 → 1 Oct 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13078 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th International Conference on Optimization and Applications, OPTIMA 2021
City	Virtual, Online
Period	27/09/2021 → 01/10/2021

Research areas

Branch-and-bound algorithm, Generalized Traveling Salesman Problem, Precedence constraints

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

ID: 29063584