Submitter Variables Constraints Density Status Group Objective MPS File
E. Coughlan, M. Lübbecke, J. Schulz 18380 576 1.03624e-02 easy 302 30n20b8.mps.gz

Multi-mode resource leveling with availability constraints; precedence and resource constrained scheduling problem

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 18380 8033
Constraints 576 491
Binaries 18318 7971
Integers 62 62
Continuous 0 0
Implicit Integers 0 60
Fixed Variables 7282 0
Nonzero Density 0.0103624 0.0134737
Nonzeroes 109706 53143
Constraint Classification Properties
Original Presolved
Total 576 491
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 60 57
Variable Bound 0 0
Set Partitioning 30 30
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 0 0
General Linear 486 404
Indicator 0 0

Structure

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

value min median mean max
Components 0.4771212
Constraint % 43.5845 44.1955 44.1955 44.8065
Variable % 47.7779 50.0000 50.0000 52.2221
Score 0.4416840

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
2 302 302 0 0 0 - 2018-10-29 Solution found during MIPLIB2017 problem selection.
1 302 302 0 0 0 - 2018-10-12 Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to 30n20b8 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
csched010 1758 1457 0 301 351 6376 Tallys Yunes csched easy 408
csched007 1758 1457 0 301 351 6379 Tallys Yunes csched easy 351
csched008 1536 1284 0 252 351 5687 Tallys Yunes csched easy 173
neos-5182409-nasivi 2005 1600 0 405 580 14884 Jeff Linderoth neos-pseudoapplication-32 easy 302
neos-1456979 4605 4245 180 180 6770 36440 NEOS Server Submission neos-pseudoapplication-102 easy 176

Reference

@incollection{CoughlanLuebbeckeSchulz2010,
 author = {Coughlan, Eamonn and L{\"u}bbecke, Marco and Schulz, Jens},
 booktitle = {Experimental Algorithms},
 editor = {Festa, Paola},
 pages = {226-238},
 publisher = {Springer Berlin / Heidelberg},
 series = {Lecture Notes in Computer Science},
 title = {A Branch-and-Price Algorithm for Multi-mode Resource Leveling},
 volume = {6049},
 year = {2010}
}

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