Sparsity pattern

k16x240

Namek16x240
Downloadk16x240.mps.gz
Solutionk16x240.sol.gz
Set Membership Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorF. Ortega, L. Wolsey
Rows256
Cols480
Num. non-zeros in A960
Num. non-zeros in c480
Rows/Cols0.533333333333
Integers
Binaries240
Continuous240
min nonzero |Aij|1
max |Aij|1000
min nonzero |cj|1
max |cj|996
Integer Objective10674
LP Objective2769.838
Aggregation
Variable Bound240
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/116
General Cons.
References OrtegaWolsey2003

Fixed cost network flow problems


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