Benchmarks Based on Model RB

• Forced Satisfiable CSP and SAT Benchmarks of Model RB
• Benchmarks with Hidden Optimum Solutions for Independent Set, Vertex Cover, Clique and Vertex Coloring
• Pseudo-Boolean (0-1 Integer Programming) Benchmarks with Hidden Optimum Solutions
• Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing and Winner Determination
• Weighted Max-2-SAT Benchmarks with Hidden Optimum Solutions

---

Table of contents

• Forced Satisfiable CSP and SAT Benchmarks of Model RB
• Benchmarks with Hidden Optimum Solutions for Graph Problems
• Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing and Winner Determination