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)
-
Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem
Cordeau, Jean-François, (2014)
-
Review of solution approaches for the symmetric traveling salesman problem
Saharidis, Georgios K. D., (2014)
- More ...
-
On data reduction for dynamic vector bin packing
Van Bevern, René, (2023)
-
Constant-factor approximations for capacitated arc routing without triangle inequality
Van Bevern, René, (2014)
-
Interval scheduling and colorful independent sets
Van Bevern, René, (2015)
- More ...