Sparsity pattern

dc1c

Namedc1c
Downloaddc1c.mps.gz
Solutiondc1c.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorDouble-Click SAS
Rows1649
Cols10039
Num. non-zeros in A121158
Num. non-zeros in c10039
Rows/Cols0.164259388385
Integers
Binaries8380
Continuous1659
min nonzero |Aij|1
max |Aij|10000000
min nonzero |cj|100
max |cj|10000000
Integer Objective1767903.6501
LP Objective1754946.863638
Aggregation2
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack1
Knapsacks
Integer Knapsack
Mixed 0/11647
General Cons.
References FischettiGloverLodi2005 FischettiLodi2003

Crew scheduling instance. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 1100 hours with 14 times restarted 15 jobs.


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