| Name | manna81 |
| Download | manna81.mps.gz |
| Solution | manna81.sol.gz |
| Orginator | Arie Koster, Adrian Zymolka |
| Formulator | Arie Koster, Adrian Zymolka |
| Donator | Arie Koster, Adrian Zymolka |
| Rows | 6480 |
| Cols | 3321 |
| Non-zeros | 12960 |
| Integers | 3303 |
| Binaries | 18 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 1.00000000e+00 |
| Integer Objective | -1.31640000e+04 |
| LP Objective | -1.32970000e+04 |
| Root LP Basis | manna81.bas.gz |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | 6480 |
| Upper bounds | |
| Lower bounds | |
| Mixed 0/1 | |
| General Cons. | |
| References | KosterZymolka2003 |
Stable multi sets on a graph with 3321 nodes and 6480 edges. A maximum clique instance from http://dimacs.ruetgers.edu/Challenges was complemented, and bounds on nodes and edges were randomly set to form a stable multi sets instance.
It is possible to separate cycling inequalities that will speed up the solving process considerable.
Another possibility to solve the instance is to extensively add gomory cuts in the root node (CPLEX: "set mip cuts gomory 2", XPRESS: "gomcuts = 3").