A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number
Year of publication: |
2024
|
---|---|
Authors: | Van Bevern, René ; Skachkov, Daniel A. |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 52.2024, p. 1-3
|
Subject: | Data reduction | NP-hard problem | Preprocessing | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem |
-
Basu, Sumanta, (2017)
-
Gołąbek, Łukasz, (2021)
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
- More ...
-
Afanasev, Vsevolod A., (2021)
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Parameterized complexity of machine scheduling : 15 open problems
Mnich, Matthias, (2018)
- More ...