Sparsity pattern

rococoC11-011100

NamerococoC11-011100
DownloadrococoC11-011100.mps.gz
SolutionrococoC11-011100.sol.gz
Set Membership Challenge Reoptimize
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorA. Chabrier, E. Danna, C. Le Pape, L. Perron
Rows2367
Cols6491
Num. non-zeros in A30472
Num. non-zeros in c1
Rows/Cols0.364658758281
Integers166
Binaries6325
Continuous
min nonzero |Aij|1
max |Aij|4102
min nonzero |cj|1
max |cj|1
Integer Objective20889
LP Objective9024.205406
Aggregation220
Variable Bound165
Set partitioning110
Set packing
Set covering
Cardinality495
Equality Knapsacks
Bin packing
Invariant Knapsack55
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.221
References ChabrierDannaLePapePerron2004

Model for dimensioning the arc capacities in a telecommunication network. Solved by Gurobi 4.5.1 (4 threads) in 66892.47 seconds.


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