roll3000

benchmark benchmark_suitable precedence variable_bound set_packing set_covering invariant_knapsack binpacking integer_knapsack mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
L. Kroon 1166 2295 1.09814e-02 easy 12889.999992 roll3000.mps.gz

Rolling stock and line planning instance

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 1166 1041
Constraints 2295 1707
Binaries 246 624
Integers 492 115
Continuous 428 302
Implicit Integers 0 1
Fixed Variables 0 0
Nonzero Density 0.0109814 0.0160581
Nonzeroes 29386 28535
Constraint Classification Properties
Original Presolved
Total 2295 1707
Empty 1 0
Free 0 0
Singleton 587 0
Aggregations 0 0
Precedence 1 11
Variable Bound 65 65
Set Partitioning 0 0
Set Packing 31 107
Set Covering 119 119
Cardinality 0 0
Invariant Knapsack 0 189
Equation Knapsack 0 0
Bin Packing 0 255
Knapsack 0 0
Integer Knapsack 238 162
Mixed Binary 81 10
General Linear 1172 789
Indicator 0 0

Structure

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

value min median mean max
Components 1.380211
Constraint % 0.0585823 2.31273 3.16344 6.56122
Variable % 0.1912050 3.14656 4.01530 8.89101
Score 0.499519

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 1 12890 12890 7e-07 1.4e-06 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.
1 2 12890 12890 0e+00 0.0e+00 0 - 2018-10-12 Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to roll3000 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 Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
neos-5182409-nasivi easy 2005 1600 0 405 580 14884 Jeff Linderoth neos-pseudoapplication-32 301.99999992 benchmark_suitable aggregations set_partitioning set_packing invariant_knapsack mixed_binary general_linear
misc05inf easy 136 74 0 62 301 2946 MIPLIB submission pool misc Infeasible infeasible variable_bound set_partitioning set_covering cardinality mixed_binary general_linear
neos-555884 easy 3815 3800 15 0 4331 19067 NEOS Server Submission neos-pseudoapplication-32 1232700 decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning cardinality equation_knapsack binpacking mixed_binary general_linear
physiciansched3-4 open 74119 65900 0 8219 239780 908634 Pelin Damci-Kurt physiciansched 1481156.4133* aggregations precedence variable_bound set_packing set_covering invariant_knapsack binpacking knapsack mixed_binary general_linear
physiciansched5-3 easy 14488 11501 0 2987 31925 156378 Pelin Damci-Kurt physiciansched 21100 decomposition benchmark_suitable precedence variable_bound set_packing set_covering invariant_knapsack binpacking mixed_binary

Reference

@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 Mär 19, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint