|
0-1 Programming Benchmarks with Hidden Optimum Solutions

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/pb-benchmarks.htm | |
|
|
|
| Ke Xu | |
| 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. | |
|
|
|
| Levels: | Research |
| Languages: | English |
| Resource Types: | Net-Based Resources |
| Math Topics: | Discrete Math, Optimization, Computer Science |
[Privacy Policy] [Terms of Use]


© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.