Sparsity pattern

bab5

Namebab5
Downloadbab5.mps.gz
Solutionbab5.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorE. Swarat
Rows4964
Cols21600
Num. non-zeros in A155520
Num. non-zeros in c12328
Rows/Cols0.229814814815
Integers
Binaries21600
Continuous
min nonzero |Aij|0.09
max |Aij|8
min nonzero |cj|15.2099
max |cj|3721.63
Integer Objective-106411.8401
LP Objective-124657.641413
Aggregation4
Variable Bound
Set partitioning457
Set packing88
Set covering
Cardinality548
Equality Knapsacks320
Bin packing
Invariant Knapsack3443
Knapsacks12
Integer Knapsack
Mixed 0/174
General Cons.
References

Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems


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