Sparsity pattern

mkc

Namemkc
Downloadmkc.mps.gz
Solutionmkc.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorJ. Kalagnanam, M. Dawande
Rows3411
Cols5325
Num. non-zeros in A17038
Num. non-zeros in c2946
Rows/Cols0.640563380282
Integers
Binaries5323
Continuous2
min nonzero |Aij|1
max |Aij|38.31
min nonzero |cj|3.744
max |cj|40
Integer Objective-563.846
LP Objective-611.85
Aggregation
Variable Bound2977
Set partitioning
Set packing252
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack24
Knapsacks
Integer Knapsack
Mixed 0/126
General Cons.
References DawandeKalagnanam1998 ForrestKalagnanamLadanyi2006

Multiple knapsack problem with color constraints. John Forrest, Laszlo Ladanyi and Jayant Kalagnanam solved this instance by reformulation in 1999.


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