Submitter Variables Constraints Density Status Group Objective MPS File
Double-Click SAS 11612 1803 9.09481e-03 hard 6609253 dolom1.mps.gz

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.

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 11612 11521
Constraints 1803 1802
Binaries 9720 9720
Integers 0 1693
Continuous 1892 108
Implicit Integers 0 1693
Fixed Variables 0 0
Nonzero Density 0.00909481 0.00915979
Nonzeroes 190413 190165
Constraint Classification Properties
Original Presolved
Total 1803 1802
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 1803 108
General Linear 0 1694
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 0.301030
Constraint % 5.99334 5.99334 5.99334 5.99334
Variable % 85.30510 85.30510 85.30510 85.30510
Score 0.008807

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
1 6644479 6644479 0 0 0 - 2018-10-11 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to dolom1 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Status Objective
trento1 7687 6415 0 1272 1265 93571 MIPLIB submission pool easy 5189487
nsr8k 38356 32040 0 6316 6284 371608 MIPLIB submission pool open 18507854.9999999*
biella1 7328 6110 0 1218 1203 71489 Double-Click SAS easy 3065005.78
dc1c 10039 8380 0 1659 1649 121158 Double-Click SAS hard 1767903.6501
siena1 13741 11775 0 1966 2220 258915 Double-Click SAS open 10584965.7*

Reference

@article{FischettiGloverLodi2005,
 author = {M. Fischetti and F. Glover and A. Lodi},
 journal = {Mathematical Programming},
 pages = {91--104},
 title = {The feasibility pump},
 volume = {104},
 year = {2005}
}

@article{FischettiLodi2003,
 author = {Fischetti, Matteo and Lodi, Andrea},
 issn = {0025-5610},
 issue = {1},
 journal = {Mathematical Programming},
 keyword = {Mathematics and Statistics},
 pages = {23-47},
 publisher = {Springer},
 title = {Local branching},
 volume = {98},
 year = {2003}
}

Last Update Nov 19, 2018 by Gregor Hendel
generated with R Markdown
© 2018 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint