Sparsity pattern

atm20-100

Nameatm20-100
Downloadatm20-100.mps.gz
Solutionatm20-100.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorM. Galati
Rows4380
Cols6480
Num. non-zeros in A58878
Num. non-zeros in c4000
Rows/Cols0.675925925926
Integers
Binaries2220
Continuous4260
min nonzero |Aij|0.1
max |Aij|13035
min nonzero |cj|1
max |cj|1
Integer Objective2463621.57727541
LP Objective2141734.684878
Aggregation
Variable Bound2220
Set partitioning20
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack20
Knapsacks
Integer Knapsack
Mixed 0/12120
General Cons.
References Galati2010

ATM cash management problem.

Solved with COIN/DIP in 1066 sec. (1 thread) / 259 sec. (8 threads) in June 2011.


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint