Sparsity pattern

seymour-disj-10

Nameseymour-disj-10
Downloadseymour-disj-10.mps.gz
Solutionseymour-disj-10.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorM. Ferris, G. Pataki, S. Schmieta
Rows5108
Cols1209
Num. non-zeros in A64704
Num. non-zeros in c1209
Rows/Cols4.22497932175
Integers
Binaries1209
Continuous
min nonzero |Aij|1.003048e-08
max |Aij|9
min nonzero |cj|1
max |cj|1
Integer Objective287
LP Objective280.817818
Aggregation
Variable Bound270
Set partitioning
Set packing
Set covering4538
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack4649
Knapsacks
Integer Knapsack
Mixed 0/1300
General Cons.
References FerrisPatakiSchmieta2001

The seymour instance after adding 10 rounds of disjunctive cuts. Solved by Gurobi 4.5.1 (12 threads) in 9065.52 seconds.


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