@INCOLLECTION{Garfinkel1985,
  author = {R.S. Garfinkel},
  title = {Motivation and Modeling},
  year = {1985},
  chapter = {2},
  pages = {17--36},
  crossref = {Lawler1985},
  owner = {hahsler},
  timestamp = {2006.11.06}
}

@INCOLLECTION{Hoffman1985,
  author = {A.J. Hoffman and P. Wolfe},
  title = {History},
  year = {1985},
  chapter = {1},
  pages = {1--16},
  crossref = {Lawler1985},
  owner = {hahsler}
}

@INCOLLECTION{Johnson2002,
  author = {D.S. Johnson and L.A. McGeoch},
  title = {Experimental Analysis of Heuristics for the {STSP}},
  year = {2002},
  chapter = {9},
  pages = {369--444},
  crossref = {Gutin2002},
  owner = {hahsler},
  timestamp = {2006.12.07}
}

@INCOLLECTION{Johnson1985,
  author = {D.S. Johnson and C.H. Papadimitriou},
  title = {Performance guarantees for heuristics},
  year = {1985},
  chapter = {5},
  pages = {145--180},
  crossref = {Lawler1985},
  owner = {hahsler},
  timestamp = {2006.10.06}
}

@INCOLLECTION{Johnson1985a,
  author = {D.S. Johnson and C.H. Papadimitriou},
  title = {Computational complexity},
  year = {1985},
  chapter = {3},
  pages = {37--86},
  crossref = {Lawler1985},
  owner = {hahsler},
  timestamp = {2006.10.06}
}

@INCOLLECTION{Punnen2002,
  author = {A.P. Punnen},
  title = {The Traveling Salesman Problem: Applications, Formulations and Variations},
  year = {2002},
  chapter = {1},
  pages = {1--28},
  crossref = {Gutin2002},
  owner = {hahsler},
  timestamp = {2006.12.06}
}

@INCOLLECTION{Rego2002,
  author = {C. Rego and F. Glover},
  title = {Local Search and Metaheuristics},
  year = {2002},
  chapter = {8},
  pages = {309--368},
  crossref = {Gutin2002},
  owner = {hahsler},
  timestamp = {2006.12.06}
}

@ARTICLE{Alpert1997,
  author = {C. J. Alpert and A. B. Kahng},
  title = {Splitting an Ordering into a Partititon to Minimize Diameter},
  journal = {Journal of Classification},
  year = {1997},
  volume = {14},
  pages = {51--74},
  number = {1},
  owner = {hahsler},
  timestamp = {2006.12.19}
}

@MANUAL{Applegate2006,
  title = {Concorde {TSP} Solver},
  author = {David Applegate and Robert Bixby and Vasek Chv{\'a}tal and William Cook},
  year = {2006},
  owner = {hahsler},
  timestamp = {2006.10.06},
  url = {http://www.tsp.gatech.edu/concorde/}
}

@ARTICLE{Applegate1998,
  author = {David Applegate and Robert Bixby and Vasek Chv{\'a}tal and William Cook},
  title = {On the Solution of Traveling Salesman Problems},
  journal = {Documenta Mathematica},
  year = {1998},
  volume = {Extra Volume ICM},
  pages = {645--656},
  owner = {hahsler},
  timestamp = {2006.10.06}
}

@INPROCEEDINGS{Applegate2000,
  author = {David Applegate and Robert E. Bixby and Vasek Chv{\'a}tal and William
	Cook},
  title = {{TSP} Cuts Which Do Not Conform to the Template Paradigm},
  booktitle = {Computational Combinatorial Optimization, Optimal or Provably Near-Optimal
	Solutions},
  year = {2000},
  editor = {M. Junger and D. Naddef},
  volume = {2241},
  series = {Lecture Notes In Computer Science},
  pages = {261--304},
  address = {London, UK},
  publisher = {Springer-Verlag},
  owner = {hahsler},
  timestamp = {2006.10.06}
}

@ARTICLE{Applegate2003,
  author = {David Applegate and William Cook and Andre Rohe},
  title = {Chained {L}in-{K}ernighan for Large Traveling Salesman Problems},
  journal = {{INFORMS} Journal on Computing},
  year = {2003},
  volume = {15},
  pages = {82--92},
  number = {1},
  owner = {hahsler}
}

@ARTICLE{Climer2006,
  author = {Sharlee Climer and Weixiong Zhang},
  title = {Rearrangement Clustering: Pitfalls, Remedies, and Applications},
  journal = {Journal of Machine Learning Research},
  year = {2006},
  volume = {7},
  pages = {919--943},
  month = jun,
  owner = {hahsler},
  timestamp = {2006.10.06}
}

@ARTICLE{Croes1958,
  author = {G. A. Croes},
  title = {A Method for Solving Traveling-Salesman Problems},
  journal = {Operations Research},
  year = {1958},
  volume = {6},
  pages = {791--812},
  number = {6},
  owner = {hahsler},
  timestamp = {2006.11.29}
}

@ARTICLE{Dantzig1954,
  author = {G.B. Dantzig and D.R. Fulkerson and S.M. Johnson},
  title = {Solution of a Large-scale Traveling Salesman Problem},
  journal = {Operations Research},
  year = {1954},
  volume = {2},
  pages = {393--410},
  owner = {hahsler},
  timestamp = {2006.12.10}
}

@INPROCEEDINGS{Gomory1963,
  author = {R.E. Gomory},
  title = {An algorithm for integer solutions to linear programs},
  booktitle = {Recent Advances in Mathematical Programming},
  year = {1963},
  editor = {R.L. Graves and P. Wolfe},
  pages = {269--302},
  address = {New York},
  publisher = {McGraw-Hill},
  owner = {hahsler},
  timestamp = {2006.12.10}
}

@TECHREPORT{Hahsler2007a,
  author = {Michael Hahsler and Kurt Hornik and Christian Buchta},
  title = {Getting Things in Order: An Introduction to the {R} package seriation},
  institution = {Research Report Series, Department of Statistics and Mathematics,
	Wirtschaftsuniversit{\"a}t Wien},
  year = {2007},
  type = {Report},
  number = {58},
  address = {Augasse 2--6, 1090 Wien, Austria},
  month = {August},
  owner = {hahsler},
  timestamp = {2007.12.04}
}

@ARTICLE{Held1962,
  author = {M. Held and R.M. Karp},
  title = {A Dynamic Programming Approach to Sequencing Problems},
  journal = {Journal of {SIAM}},
  year = {1962},
  volume = {10},
  pages = {196--210},
  owner = {hahsler},
  timestamp = {2006.11.27}
}

@ARTICLE{Hubert1978,
  author = {Lawrence J. Hubert and Frank B. Baker},
  title = {Applications of Combinatorial Programming to Data Analysis: The Traveling
	Salesman and Related Problems},
  journal = {Psychometrika},
  year = {1978},
  volume = {43},
  pages = {81--91},
  number = {1},
  month = {March},
  owner = {hahsler},
  timestamp = {2007.12.04}
}

@INPROCEEDINGS{Johnson2004,
  author = {David Johnson and Shankar Krishnan and Jatin Chhugani and Subodh
	Kumar and Suresh Venkatasubramanian},
  title = {Compressing Large Boolean Matrices Using Reordering Techniques},
  booktitle = {Proceedings of the 30th VLDB Conference},
  year = {2004},
  pages = {13--23},
  owner = {hahsler},
  timestamp = {2006.12.19}
}

@ARTICLE{Johnson2006,
  author = {Olin Johnson and Jing Liu},
  title = {A traveling salesman approach for predicting protein functions},
  journal = {Source Code for Biology and Medicine},
  year = {2006},
  volume = {1},
  pages = {1--7},
  number = {3},
  owner = {hahsler},
  timestamp = {2007.11.28}
}

@ARTICLE{Jonker1983,
  author = {Jonker, R. and Volgenant, T.},
  title = {Transforming asymmetric into symmetric traveling salesman problems},
  journal = {Operations Research Letters},
  year = {1983},
  volume = {2},
  pages = {161--163},
  owner = {hahsler},
  timestamp = {2006.12.05}
}

@INPROCEEDINGS{Kruskal1956,
  author = {J.B. Kruskal},
  title = {On the shortest spanning subtree and the traveling salesman problem},
  booktitle = {Proceedings of the American Mathematical Society},
  year = {1956},
  pages = {48--50},
  owner = {hahsler},
  timestamp = {2006.10.06}
}

@ARTICLE{Land1960,
  author = {A.H. Land and A.G. Doig},
  title = {An Automatic Method for Solving Discrete Programming Problems},
  journal = {Econometrica},
  year = {1960},
  volume = {28},
  pages = {497--520},
  owner = {hahsler},
  timestamp = {2006.12.12}
}

@ARTICLE{Lenstra1975,
  author = {J.K. Lenstra and A.H.G. Rinooy Kan},
  title = {Some simple applications of the travelling salesman problem},
  journal = {Operational Research Quarterly},
  year = {1975},
  volume = {26},
  pages = {717--733},
  number = {4},
  month = {November},
  owner = {hahsler},
  timestamp = {2006.11.07}
}

@ARTICLE{Lenstra1974,
  author = {J. K. Lenstra},
  title = {Clustering a Data Array and the Traveling-Salesman Problem},
  journal = {Operations Research},
  year = {1974},
  volume = {22},
  pages = {413--414},
  number = {2},
  owner = {hahsler},
  timestamp = {2006.12.19}
}

@ARTICLE{Lin1965,
  author = {S. Lin},
  title = {Computer solutions of the traveling-salesman problem},
  journal = {Bell System Technology Journal},
  year = {1965},
  volume = {44},
  pages = {2245--2269},
  owner = {hahsler},
  timestamp = {2006.11.29}
}

@ARTICLE{Lin1973,
  author = {S. Lin and B.W. Kernighan},
  title = {An effective heuristic algorithm for the traveling-salesman problem},
  journal = {Operations Research},
  year = {1973},
  volume = {21},
  pages = {498--516},
  number = {2},
  owner = {hahsler},
  timestamp = {2006.11.27}
}

@ARTICLE{Padberg1990,
  author = {M. Padberg and G. Rinaldi},
  title = {Facet identification for the symmetric traveling salesman polytope},
  journal = {Mathematical Programming},
  year = {1990},
  volume = {47},
  pages = {219--257},
  number = {2},
  address = {Secaucus, NJ, USA},
  issn = {0025-5610},
  publisher = {Springer-Verlag New York, Inc.}
}

@ARTICLE{Prim1957,
  author = {R.C. Prim},
  title = {Shortest connection networks and some generalisations},
  journal = {Bell System Technical Journal},
  year = {1957},
  volume = {36},
  pages = {1389--1401},
  owner = {hahsler},
  timestamp = {2006.10.06}
}

@ARTICLE{Ray2007,
  author = {S. S. Ray and S. Bandyopadhyay and S. K. Pal},
  title = {Gene Ordering in Partitive Clustering using Microarray Expressions},
  journal = {Journal of Biosciences},
  year = {2007},
  volume = {32},
  pages = {1019--1025},
  number = {5},
  month = {August},
  owner = {hahsler},
  timestamp = {2007.11.28}
}

@MANUAL{Reinelt2004,
  title = {{TSPLIB}},
  author = {Gerhard Reinelt},
  organization = {Universit{\"a}t Heidelberg, Institut f{\"u}r Informatik},
  address = {Im Neuenheimer Feld 368,D-69120 Heidelberg, Germany},
  year = {2004},
  owner = {hahsler},
  timestamp = {2006.10.06},
  url = {http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/}
}

@ARTICLE{Rosenkrantz1977,
  author = {Daniel J. Rosenkrantz and Richard E. Stearns and Philip M. Lewis,
	II},
  title = {An Analysis of Several Heuristics for the Traveling Salesman Problem},
  journal = {{SIAM} Journal on Computing},
  year = {1977},
  volume = {6},
  pages = {563--581},
  number = {3},
  owner = {hahsler},
  timestamp = {2006.11.13}
}

@BOOK{Gutin2002,
  title = {The Traveling Salesman Problem and Its Variations},
  publisher = {Kluwer},
  year = {2002},
  editor = {G. Gutin and A.P. Punnen},
  volume = {12},
  series = {Combinatorial Optimization},
  address = {Dordrecht},
  owner = {hahsler},
  timestamp = {2006.11.29}
}

@BOOK{Lawler1985,
  title = {The Traveling Salesman Problem},
  publisher = {Wiley},
  year = {1985},
  editor = {Lawler, E. L. and Lenstra, J. K. and Rinnooy Kan, A. H. G. and Shmoys,
	D. B.},
  address = {New York},
  owner = {hahsler},
  timestamp = {2006.10.05}
}

@comment{jabref-meta: selector_journal:}

@comment{jabref-meta: selector_author:}

@comment{jabref-meta: selector_keywords:}

@comment{jabref-meta: selector_publisher:}

@Manual{TSP:Hahsler+Buchta+Hornik:2006,
  title	       = {seriation: Infrastructure for seriation},
  author       = {Michael Hahsler and Christian Buchta and Kurt Hornik},
  year	       = 2006,
  note	       = {R package version 0.1-1},
}
@Article{TSP:Pebesma+Bivand:2005,
  author       = {Edzer J. Pebesma and Roger S. Bivand},
  title	       = {Classes and methods for spatial data in {R}},
  journal      = {R News},
  year	       = 2005,
  volume       = 5,
  number       = 2,
  pages	       = {9--13},
  month	       = {November},
  url	       = {http://CRAN.R-project.org/doc/Rnews/},
}

@ARTICLE{TSP:Hahsler+Hornik2007,
    AUTHOR = {Michael Hahsler and Kurt Hornik},
    TITLE = {{TSP} -- {I}nfrastructure for the Traveling Salesperson
        Problem},
    JOURNAL = {Journal of Statistical Software},
    YEAR = {2007},
    VOLUME = {23},
    PAGES = {1-21},
    NUMBER = {2},
    MONTH = {December},
    ISSN = {1548-7660}
}
