Sparsity pattern

30n20b8

Name30n20b8
Download30n20b8.mps.gz
Solution30n20b8.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorE. Coughlan, M. Lübbecke, J. Schulz
Rows576
Cols18380
Num. non-zeros in A109706
Num. non-zeros in c2
Rows/Cols0.0313384113166
Integers7344
Binaries11036
Continuous
min nonzero |Aij|1
max |Aij|224
min nonzero |cj|51
max |cj|100
Integer Objective302
LP Objective1.566408
Aggregation
Variable Bound60
Set partitioning30
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.486
References CoughlanLuebbeckeSchulz2010

Multi-mode resource leveling with availability constraints; precedence and resource constrained scheduling problem


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