Sparsity pattern

dolom1

Namedolom1
Downloaddolom1.mps.gz
Solutiondolom1.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorDouble-Click SAS
Rows1803
Cols11612
Num. non-zeros in A190413
Num. non-zeros in c11612
Rows/Cols0.155270409921
Integers
Binaries9720
Continuous1892
min nonzero |Aij|1
max |Aij|100000000
min nonzero |cj|200
max |cj|100000000
Integer Objective6609253
LP Objective6556066.068315
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack1
Knapsacks
Integer Knapsack
Mixed 0/11803
General Cons.
References FischettiGloverLodi2005 FischettiLodi2003

Crew scheduling instance. Solved with ParaSCIP with SCIP 3.0.1 linked to CPLEX 12.5 as an LP solver on HLRN III with 12288 cores in two runs First run found a feasible solution whose objective function value is 6615265.0000. Giving the feasible solution, the second run solved the instance in 13684.7671 sec.


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