Sparsity pattern

mkc

Namemkc
Downloadmkc.mps.gz
OrginatorJayant Kalagnanam, Milind Dawande
FormulatorJayant Kalagnanam, Milind Dawande
DonatorJayant Kalagnanam, Milind Dawande
Rows3411
Cols5325
Non-zeros17038
Integers
Binaries5323
Continuous
|Min|1.00000000e+00
|Max|3.83100000e+01
Integer Objective-5.63846000e+02
LP Objective-6.11850000e+02
Root LP Basismkc.bas.gz
Set partitioning
Set packing3361
Set covering
Cardinality
Equality Knapsacks
Bin packing24
Invariant Knapsack24
Knapsacks
Integer Knapsack
Upper bounds
Lower bounds
Mixed 0/12
General Cons.
References LadanyiForrestKalagnanam2001 ForrestLadanyi1999

multiple knapsack with color constraints

John Forrest, Laszlo Ladanyi and Jayant Kalagnanam solved this instance by reformulation in 1999.


Last Update : 2010/06/09 13:56:11 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint