Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
Author:
- Jürg NievergeltJNJürg Nievergelt
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 18-35
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Enumerating the k best plane spanning treesComputational Geometry, 2001
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- All the needles in a haystack: Can exhaustive search overcome combinatorial chaos?1995
- The Solution of the Four-Color-Map ProblemScientific American, 1977