Browse by Keywords

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 27.

Jünger, Michael and Schulz, Michael and Zychowicz, Wojciech (2009) GEODUAL: Fun with Geometric Duality.
Technical Report , 20 p.

Buchheim, Christoph and Liers, Frauke and Oswald, Marcus (2008) Local Cuts Revisited.
Published in: Operations Research Letters Vol. 36 (4). pp. 430-433.

Naddef, Denis and Thienel, Stefan (2002) Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem I: General Tools and Comb Separation.
Published in: Mathematical programming : Series A Vol. 92 (2). pp. 237-255.

Naddef, Denis and Thienel, Stefan (2002) Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem II: Separating multi Handle Inequalities.
Published in: Mathematical programming : Series A Vol. 92 (2). pp. 257-283.

Elf, Matthias and Gutwenger, Carsten and Jünger, Michael and Rinaldi, Giovanni (2001) Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.
Published in: Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions., Lecture Notes in Computer Science. 2241 Springer 2001, pp. 157-222.

Arkin, Esther M. and Fekete, Sandor P. and Mitchell, Joseph S. B. (2000) Approximation algorithms for lawn mowing and milling.
Published in: Computational geometry : theory and applications Vol. 17 (1-2). pp. 25-50.

Fekete, Sandor P. (2000) On Simple Polygonalizations with Optimal Area.
Published in: Discrete & computational geometry : an international journal of mathematics and computer science. Vol. 23 (1). pp. 73-110.

Fekete, Sandor P. (1999) Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances.
Published In: Soda'99 : Proceedings of the tenth annual ACM-SIAM Symposium on Discrete Algorithms ; Baltimore, Maryland, January 17 - 19, 1999 ACM 1999, pp. 337-345.

Fekete, Sandor P. (1998) Finding maximum length tours under Euclidean norms.
Technical Report , 5 p.

Barvinok, A. and Fekete, Sandor P. and Johnson, David S. and Tamir, Arie and Woeginger, Gerhard J. and Woodroofe, D. (1998) The Maximum Traveling Salesman Problem.

Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1998) On approximately fair cost allocation in Euclidean TSP games.
Published in: OR Spektrum Vol. 20 (1). pp. 29-37.

Fekete, Sandor P. and Pulleyblank, William R. (1998) A note on the Traveling Preacher Problem.
Technical Report , 5 p.

Fekete, Sandor P. and Woeginger, Gerhard J. (1997) Angle-Restricted Tours in the Plane.
Published in: Computational Geometry Vol. 8 (4). pp. 195-218.

Fekete, Sandor P. (1997) Area optimization of simple polygons.
Technical Report , 45 p.

Hochstättler, Winfried (1997) Duality in Combinatorial Optimization -- Sometimes it Works, Sometimes it Won't.
Technical Report , 57 p.

Fekete, Sandor P. (1997) Geometric Ideas for Graph Representation and for Cooperative Game Theory.
Technical Report , 54 p.

Fekete, Sandor P. and Schmitt, Matthias (1997) Traveling Salesmen in the Age of Competition.
Technical Report , 5 p.

Hamacher, Anja and Moll, Christoph (1996) The Euclidian Traveling Salesman Selection Problem.
Published In: Selected papers of the Symposium on Operations Research (SOR'95) : Passau, September 13 - September 15, 1995 Springer 1996, pp. 54-59.

Thienel, Stefan (1996) A Simple TSP-Solver: An ABACUS Tutorial.
Technical Report , 34 p.

Jünger, Michael and Störmer, Peter (1995) Solving large-scale traveling salesman problems with parallel Branch-and-Cut.
Technical Report , 35 p.

Jünger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni (1995) The Traveling Salesman Problem.
Published in: Network models., Handbooks in operations research and management science. Elsevier 1995, pp. 225-330.

Bachem, Achim and Steckemetz, Barthel and Wottawa, Michael (1994) An efficient parallel cluster-heuristic for large TSPs.
Technical Report , 10 p.

Fekete, Sandor P. and Pulleyblank, William R. (1993) Backward Error Analysis for the Travelling Salesman Problem: Generalized Convexity.
Technical Report , 31 p.

Bachem, Achim and Wottawa, Michael (1992) Parallelisierung von Heuristiken für große Traveling Salesman Probleme.
Published In: Parallele Datenverarbeitung mit dem Transputer : 4. Transputer-Anwender-Treffen TAT '92, Aachen, 22. - 23. September 1992, Informatik aktuell. Springer 1992, p. 12.

Bachem, Achim and Wottawa, Michael (1991) Ein 18512-Städte (Deutschland-)Traveling-Salesman-Problem.
Technical Report , 2 p.

Kern, Walter (1989) On the Rate of Convergence of some Stochastic Processes.
Published in: Mathematics of Operations Research Vol. 14 (2). pp. 275-280.

Leclerc, Matthias (1987) Algorithmen für kombinatorische Optimierungsprobleme mit Partitionsbeschränkungen. PhD thesis.

This list was generated on Tue Sep 26 02:16:29 2017 CEST.