Sparsity pattern

manna81

Namemanna81
Downloadmanna81.mps.gz
Solutionmanna81.sol.gz
OrginatorArie Koster, Adrian Zymolka
FormulatorArie Koster, Adrian Zymolka
DonatorArie Koster, Adrian Zymolka
Rows6480
Cols3321
Non-zeros12960
Integers3303
Binaries18
Continuous
|Min|1.00000000e+00
|Max|1.00000000e+00
Integer Objective-1.31640000e+04
LP Objective-1.32970000e+04
Root LP Basismanna81.bas.gz
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack6480
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").


Last Update : 2010/06/09 13:56:11 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint