|
Ke Xu's Benchmarks for Hard Problems

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

| http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm | |
|
|
|
| Ke Xu | |
| All benchmarks are generated based on exact phase transitions of Model RB, including forced satisfiable benchmarks of SAT/CSP and benchmarks with hidden optimum solutions for 0-1 Programming and graph problems (Independent Set, Vertex Cover, Clique and Vertex Coloring). | |
|
|
|
| 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.