Narrow search
Showing 1 - 5 of 5
Cover Image
2-matchings, the traveling salesman problem, and the subtour LP : a proof of the Boyd-Carr conjecture
Schalekamp, Frans; Williamson, David P.; Zuylen, Anke van - In: Mathematics of operations research 39 (2014) 2, pp. 403-417
Persistent link: https://www.econbiz.de/10010384200
Cover Image
Budgeted prize-collecting traveling salesman and minimum spanning tree problems
Paul, Alice; Freund, Daniel; Ferber, Aaron; Shmoys, … - In: Mathematics of operations research 45 (2020) 2, pp. 576-590
Persistent link: https://www.econbiz.de/10012242522
Cover Image
Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP
Gutekunst, Samuel C.; Williamson, David P. - In: Operations research letters 48 (2020) 3, pp. 245-248
Persistent link: https://www.econbiz.de/10012254064
Cover Image
Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
Gutekunst, Samuel C.; Williamson, David P. - In: Mathematics of operations research 47 (2022) 1, pp. 1-28
Persistent link: https://www.econbiz.de/10013364849
Cover Image
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C.; Williamson, David P. - In: Mathematics of operations research 48 (2023) 1, pp. 393-418
Persistent link: https://www.econbiz.de/10014312556