Sparsity pattern

m100n500k4r1

Namem100n500k4r1
Downloadm100n500k4r1.mps.gz
Solutionm100n500k4r1.sol.gz
Set Membership Benchmark Primal
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorL. Torres
Rows100
Cols500
Num. non-zeros in A2000
Num. non-zeros in c500
Rows/Cols0.2
Integers
Binaries500
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective-25
LP Objective-25
Aggregation
Variable Bound
Set partitioning
Set packing100
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References Torres2003

Set packing problem with 4 ones per column. Solved with Gurobi 4.5.1 on a 12-core Linux system in 1041.68 sec.


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