Sparsity pattern

tw-myciel4

Nametw-myciel4
Downloadtw-myciel4.mps.gz
Solutiontw-myciel4.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorA. Koster
Rows8146
Cols760
Num. non-zeros in A27961
Num. non-zeros in c1
Rows/Cols10.7184210526
Integers1
Binaries759
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective10
LP Objective3.838028
Aggregation71
Variable Bound688
Set partitioning
Set packing
Set covering1771
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack7364
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.23
References

Model to compute the treewidth of the Mycielski-4 instance from the DIMACS graph coloring database. Solved in June 2013 by CPLEX 12.5.1 (12 threads) in about 66 hours. The solving was performed in two steps: first solving with 50 GB tree memory limit (took 11307.42 seconds), after that, setting the tree memory limit to 80 GB and switching to depth first search (took 226152.14 seconds).


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint