Four-point conditions for the TSP : the complete complexity classification
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 6116
- Type
- D - Journal article
- DOI
-
10.1016/j.disopt.2014.09.003
- Title of journal
- Discrete Optimization
- Article number
- -
- First page
- 147
- Volume
- 14
- Issue
- -
- ISSN
- 1572-5286
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A collaboration with the Warwick Business School and partners in Austria and the Netherlands. The paper analyses the complexity of the classical Travelling Salesman Problem under natural input constraints: four-point inequalities (4PI-TSP). It closes a long line of research originating in 1950s, studying specific types of 4PI-TSP, by classifying all 21 possible constraint types according to their complexity; four non-trivial types among these were previously unresolved. The preliminary version in the prestigious SODA conference left one type unresolved; this journal article goes further by resolving that hardest type. Follow-up work has extended the approach to e.g. Bipartite TSP (Garcia&Tejel, EJOR'17).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -