Sparsity pattern

mik-250-1-100-1

Namemik-250-1-100-1
Downloadmik-250-1-100-1.mps.gz
Solutionmik-250-1-100-1.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorA. Atamtürk
Rows151
Cols251
Num. non-zeros in A5351
Num. non-zeros in c251
Rows/Cols0.601593625498
Integers150
Binaries100
Continuous1
min nonzero |Aij|1
max |Aij|1985
min nonzero |cj|23
max |cj|1790
Integer Objective-66729
LP Objective-79842.423635
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.100
References Atamturk2003 bcol

Problem with mixed integer knapsack constraints


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