0-1 Programming Benchmarks with Hidden Optimum Solutions
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Benchmarks with different problem sizes are provided, all of which are planted with hidden optimum solutions. It is expected, based on the study of phase transitions in NP-complete problems, that the difficulty of solving these benchmarks will grow very rapidly as the problem size increases.|
|Resource Types:||Net-Based Resources|
|Math Topics:||Discrete Math, Optimization, Computer Science|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.