Szczegóły

Tytuł artykułu

A note on the Miller-Tucker-Zemlin model for the asymmetric traveling salesman problem

Tytuł czasopisma

Bulletin of the Polish Academy of Sciences: Technical Sciences

Rocznik

2016

Numer

No 3 September

Autorzy publikacji

Wydział PAN

Nauki Techniczne

Wydawca

Polish Academy of Sciences

Data

2016

Identyfikator

ISSN 0239-7528, eISSN 2300-1917

Referencje

Bektas (2014), Requiem for the Zemlin subtour elimination constraints ?, European Journal of Operational Research, 236. ; Dantzig (1954), Solution of a large - scale traveling salesman problem, Operations Research, 2, 393. ; Gouveia (1999), The asymmetric travelling salesman problem and a reformulation of the Miller Tucker Zemlin constraints, European Journal of Operational Research, 112. ; Sarin (2005), New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints, Operations Research Letters, 33. ; Sherali (2002), On tightening the relaxations of Zemlin formulations for asymmetric travelling salesman problems, Operations Research, 50, 656, doi.org/10.1287/opre.50.4.656.2865 ; Miller (1960), Integer programming formulations and traveling salesman problems of Association for, Journal Computing Machinery, 7, 326, doi.org/10.1145/321043.321046 ; Zhang (1993), Truncated branch - and - bound : A case study on the asymmetric TSP of on Problems, Proc Symposium AI, 160. ; Gutin (2002), Traveling salesman should not be greedy : domination analysis of greedy - type heuristics for the TSP, Discrete Applied Mathematics, 117, 81, doi.org/10.1016/S0166-218X(01)00195-0 ; Gouveia (2001), The asymmetric travelling salesman problem : On generalizations of disaggregated Zemlin constraints, Discrete Applied Mathematics, 112. ; Cirasella (2001), The Asymmetric Traveling Salesman Problem : Algorithms Instance Generators and Tests in eds ) Algorithm Engineering and Experimentation, Lecture Notes in Computer Science, 2153. ; Öncan (2009), A comparative analysis of several asymmetric traveling salesman problem formulations, Computers & Operations Research, 36, 637, doi.org/10.1016/j.cor.2007.11.008 ; Kanellakis (1980), Local search for the asymmetric traveling salesman problem, Operations Research, 28, 1086, doi.org/10.1287/opre.28.5.1086 ; Desrochers (1991), Improvements and extensions to the Zemlin subtour elimination constraints, Operations Research Letters, 10, 27, doi.org/10.1016/0167-6377(91)90083-2

DOI

10.1515/bpasts-2016-0057

×