Sparsity pattern

mc11

Namemc11
Downloadmc11.mps.gz
Solutionmc11.sol.gz
Set Membership Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorF. Ortega, L. Wolsey
Rows1920
Cols3040
Num. non-zeros in A6080
Num. non-zeros in c1520
Rows/Cols0.631578947368
Integers
Binaries1520
Continuous1520
min nonzero |Aij|1
max |Aij|212
min nonzero |cj|1
max |cj|245
Integer Objective11689
LP Objective608.84434
Aggregation
Variable Bound1520
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1400
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