Exhaustive search, combinatorial optimization and enumeration: Exploring the potential of raw computing power

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1963, Issue , 2000, Pages 18-35

  Nievergelt, Jürg ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; POLYNOMIAL APPROXIMATION;

ASYMPTOTIC COMPLEXITY; COMPLEXITY MEASURES; EMPIRICAL RESEARCH; ENUMERATION PROBLEMS; ORDERS OF MAGNITUDE; PARALLEL AND DISTRIBUTED COMPUTING; POLYNOMIAL-TIME ALGORITHMS; QUANTITATIVE CHANGES;

COMBINATORIAL OPTIMIZATION;

EID: 84957020775     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44411-4_2     Document Type: Conference Paper

References (13)

1. K. Appel and W. Haken. The Solution of the Four-Color-Map Problem. Scientific American, pages 108–121, October 1977.
2. D. Avis and K. Fukuda. Reverse Search for Enumeration. Discrete Apllied Mathematics, 65:21–46, 1996.
3. A Bruengger. Solving hard combinatorial optimization problems in parallel. Two case studies. PhD thesis, ETH Zurich, 1997.
4. R. Gasser. Harnessing computational resources for efficient exhaustive search. PhD thesis, ETH Zurich, 1995.
5. J. Horgan. The Death of Proof. Scientific American, pages 74–82, 1993.
6. D.H. Lehmer. The machine tools of combinatorics. In E. F. Beckenbach, editor, Applied combinatorial mathematics, chapter 1, pages 5–31. Wiley, NY, edition, 1964.
7. A Marzetta. ZRAM: A library of parallel search algorithms and its use in enumeration and combinatorial optimization. PhD thesis, ETH Zurich, 1998.
8. A. Marzetta and J. Nievergelt. Enumerating the k best plane spanningtre es. In Computational Geometry—Theory and Application, 2000. To appear.
9. H. Maurer. Forecasting: An impossible necessity. In Symposium Computer and Information Technology, http://www.inf.ethz.ch/latsis2000/, Invited Talk. ETH Zurich. 2000.
10. J. Nievergelt, R. Gasser, F. Mser, and, C. Wirth. All the needles in a haystack: Can exhaustive search overcome combinatorial chaos? In J. van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science LNCS 1000, pages 254–274. Springer, 1995.
11. K. Thomson. Retrograde analysis of certain endgames. ICCA J., 9(3):131–139, 1986.
12. H. van Houten. The physical basis of digital computing. In Symposium Computer and Information Technology, http://www.inf.ethz.ch/latsis2000/, Invited Talk. ETH Zurich. 2000.
13. C. Wirth and J. Nievergelt. Exhaustive and heuristic retrograde analysis of the KPPKP endgame. ICCA J., 22(2):67–81, 1999