Sparsity pattern

beasleyC3

NamebeasleyC3
DownloadbeasleyC3.mps.gz
SolutionbeasleyC3.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorF. Ortega, L. Wolsey
Rows1750
Cols2500
Num. non-zeros in A5000
Num. non-zeros in c1250
Rows/Cols0.7
Integers
Binaries1250
Continuous1250
min nonzero |Aij|1
max |Aij|82
min nonzero |cj|1
max |cj|10
Integer Objective754
LP Objective40.426829
Aggregation160
Variable Bound1250
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1340
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