Publikationen zum TSP
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Zeitschriften und Konferenzen
[26] C. Dong, C. Ernst, G. Jaeger, D. Richter and P. Molitor: Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo-Backbones.
E13.pdf
(203,2 KB) vom 01.10.2009
In: S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti (Eds.), Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization, pp. 3-6, June 2 -5 2009, Paris, France.
[25] C. Dong, G. Jäger, D. Richter, and P. Molitor: Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.
E12.pdf
(178,2 KB) vom 01.10.2009
In: Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009), LNCS 5564, pp. 175-187, June 15 - 17 2009, San Francisco, USA.
[24] D. Ghosh, B. Goldengorin, G. Gutin, and Gerold Jäger: Tolerance-based Algorithms for the Traveling Salesman Problem
E10.pdf
(175,6 KB) vom 01.10.2009
In: Mathematical Programming and Game Theory for Decision Making edited by S.K. Neogy, R.B. Bapat, A.k. Das, and T. Parthasarathy, Chapter 5, pp. 47-59. Serie on Statistical Science and Interdisciplinary Research, vol. 1, World Scientific Publishing 2008.
[23] B. Goldengorin and G. Jäger: The Computational Efficiency of the Ji-Lee-Li Algorithm for the Assignment Problem.
E03.pdf
(111,9 KB) vom 01.10.2009
In: Algorithmic Operations Research 3(1):79-81, 2008.
[22] G. Jäger and P. Molitor: Algorithms and Experimental Study for the Traveling Salesman Problem fo Second Order.
51650211-1.pdf
(310,9 KB) vom 11.12.2008
In: Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008), St. John's, Newfoundland, LNCS 5165, pp. 211-224, Springer 2008.
[21| M. Turkensteen, D. Ghosh, B. Goldengorin, and G. Sierksma. Tolerance-based Branch and Bound algorithms for the ATSP.
EJOR 08.pdf
(519,9 KB) vom 11.12.2008
In: ScienceDirect, European Journal of Operational Research 189, pp. 775-788, 2008.
[20] G. Gutin, B. Goldengorin, and J. Huang. Worst Case Analysis of Max-Regret, Greedy, and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.
JoH 08.pdf
(345,4 KB) vom 11.12.2008
In: Journal of Heuristics 14, pp. 169-181, Springer 2008.
[19] D. Richter, B. Goldengorin, G. Jäger und P. Molitor. Improving the Efficiency of Helsgaun`s Lin-Kernighan Heuristic for the Symmetric TSP.
E15.pdf
(261,7 KB) vom 01.10.2009
In: Proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007), Halifax, Canada, LNCS 4852, pp. 99-110, August 2007.
[18] B. Goldengorin, G. Jäger und P. Molitor. Tolerances Applied in Combinatorial Optimization.
gjm06_b.pdf
(266,6 KB) vom 05.09.2006
In: Journal of Computer Science 2(9), S. 716-734, 2006.
[17] D. Ghosh, B. Goldengorin, G. Gutin und G. Jäger. Improving the Performance of Greedy Heuristics for TSPs Using Tolerances.
gggj06.pdf
(215,9 KB) vom 09.10.2006
In: Communications in Dependability and Quality Management 10(1), 2007.
[16] B. Goldengorin, G. Jäger und P. Molitor. Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
gjm06_c.pdf
(147 KB) vom 05.09.2006
In: Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2006), Lecture Notes in Computer Science 4235, S. 86-97, 2006.
[15] G. Gutin, B. Goldengorin und J. Huang. Worst Case Analysis of Max-Regret and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.
ggh06.pdf
(185,8 KB) vom 09.10.2006
In: Proceedings of the 4th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, 2006.
[14] M. Turkensteen, D. Ghosh, B. Goldengorin und G. Sierksma. Iterative Patching and the Asymmetric Traveling Salesman Problem.
tggs06.pdf
(909,9 KB) vom 07.10.2006
In: Discrete Optimization 3(1), S. 63–77, 2006.
[13] B. Goldengorin, G. Jäger und P. Molitor. Some Basics on Tolerances.
gjm06_a.pdf
(187,8 KB) vom 05.09.2006
In: S.-W. Cheng und C.K. Poon, The 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM), Lecture Notes in Computer Science 4041, S. 194–206, 2006.
[12] H. Bekker, E.P. Braad und B. Goldengorin. Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations.
bbg05_a.pdf
(181,7 KB) vom 05.09.2006
In: O. Gervasi, International Conference on Computational Science and its Applications (ICCSA), Lecture Notes in Comput. Sci. 3483, S. 397–406, 2005.
[11] H. Bekker, E.P. Braad und B. Goldengorin. Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching.
bbg05_b.pdf
(90,5 KB) vom 29.08.2006
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA), Lecture Notes in Comput. Sci. 3503, S. 610–613, 2005.
[10] B. Goldengorin und G. Jäger. How to Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive.
gj05.pdf
(216,2 KB) vom 05.09.2006
SOM (Systems, Organisations and Management) Technischer Bericht 05A11, Universität Groningen, Niederlande, 2005.
[9] M. Turkensteen, D. Ghosh, B. Goldengorin und G. Sierksma. Tolerance-based Search for Optimal Solutions of NP-Hard Problems.
tggs05.pdf
(315,1 KB) vom 07.10.2006
In: C. Maroto, EURO conference for young OR researchers and practitioners (ORP3), S. 171–182, 2005.
[8] B. Goldengorin, G. Sierksma und M. Turkensteen. Tolerance Based Algorithms for the ATSP.
gst04.pdf
(171 KB) vom 01.05.2006
In: J. Hromkovic, M. Nagl und B. Westfechtel, 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science 3353, S. 222–234, 2004.
[7] Boris Goldengorin and Gerard Sierksma. Combinatorial Optimization Tolerances Calculated in Linear Time.
SOM Report 03a30 2003.pdf
(115,6 KB) vom 11.12.2008
SOM (Systems, Organisations and Management) Technischer Bericht 03A30, Universität Groningen, Niederlande, 2003.
Dissertationen
[6] M. Turkensteen. Advanced Analysis of Branch and Bound Algorithms.
Dissertation, Universität Groningen, Niederlande, 2006.
Diplomarbeiten
[5] R. Ackermann. Toleranzbasierte Branch & Bound-Algorithmen für das asymmetrische TSP.
acke06.pdf
(725,9 KB) vom 16.08.2006
[5] Diplomarbeit, Martin-Luther-Universität Halle-Wittenberg, 2006.
[4] R. Germs. Lower Tolerance-Based Branch-and-Bound Algorithms for the ATSP.
germ06.pdf
(1,8 MB) vom 29.08.2006
Diplomarbeit, Universität Groningen, Niederlande, 2006.
[3] J. van der Heide. An Experimental Study of Tolerance-Based Greedy Heuristics for the ATSP.
heid06.pdf
(635,3 KB) vom 01.05.2006
Diplomarbeit, Universität Groningen, Niederlande, 2006.
[2] D. Richter. Toleranzen in Helsgauns Lin-Kernighan-Heuristik für das TSP.
rich06.pdf
(1,4 MB) vom 02.05.2006
Diplomarbeit, Martin-Luther-Universität Halle-Wittenberg, 2006.
[1] E.P. Braad. Selecting the Roots of Polynomial Equations Using Combinatorial Optimization.
braa05.pdf
(465,4 KB) vom 01.05.2006
Diplomarbeit, Universität Groningen, Niederlande, 2005.
Projektarbeiten
B. Eckner, N. Hahn und M. Telgkamp. ATSP Contraction Heuristics and Criteria.
eht05.pdf
(153,7 KB) vom 01.05.2006
Projektarbeit, Martin-Luther-Universität Halle-Wittenberg, 2005.
Sonstiges
D. Richter und S. Bongard. Dokumentation: Toleranzbasiertes Applet für das symmetrische TSP.
rb06_a.pdf
(652,2 KB) vom 18.10.2006
(Deutsche Version)
D. Richter und S. Bongard. Dokumentation: Toleranzbasiertes Applet für das symmetrische TSP.
rb06_b.pdf
(624,3 KB) vom 15.10.2006
(Englische Version)