mzzv11

benchmark benchmark_suitable variable_bound set_partitioning set_packing cardinality invariant_knapsack knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
S. Lukac 10240 9499 1.38381e-03 easy -21718 mzzv11.mps.gz

Railway slot allocation problems

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 10240 10240
Constraints 9499 9499
Binaries 9989 9989
Integers 251 251
Continuous 0 0
Implicit Integers 0 53
Fixed Variables 0 0
Nonzero Density 0.00138381 0.00138381
Nonzeroes 134603 134603
Constraint Classification Properties
Original Presolved
Total 9499 9499
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 129 129
Set Partitioning 1073 1073
Set Packing 5755 5755
Set Covering 28 0
Cardinality 2208 2208
Invariant Knapsack 5 33
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 1 2
Integer Knapsack 0 0
Mixed Binary 1 0
General Linear 299 299
Indicator 0 0

Structure

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

value min median mean max
Components 1.653213
Constraint % 0.168439 0.887893 0.579008 6.21118
Variable % 0.214844 2.272730 1.450200 22.80270
Score 0.367284

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

Similar instances in collection

The following instances are most similar to mzzv11 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
mzzv42z easy 11717 11482 235 0 10460 151261 MIPLIB submission pool -20540 benchmark benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality general_linear
neos-1223462 easy 5495 5180 315 0 5890 47040 NEOS Server Submission neos-pseudoapplication-12 -751.0000000645 benchmark_suitable variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack knapsack general_linear
nursesched-medium04 easy 29667 29613 54 0 8668 621829 Haroldo Gambini Santos nursescheduling 237 decomposition benchmark_suitable set_partitioning set_packing set_covering cardinality invariant_knapsack general_linear
nursesched-sprint02 easy 10250 10230 20 0 3522 204000 Haroldo Gambini Santos nursescheduling 58 benchmark benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
wachplan easy 3361 3360 1 0 1553 89361 Sebastian Orlowski -8 benchmark benchmark_suitable variable_bound set_partitioning set_packing set_covering invariant_knapsack mixed_binary general_linear

Reference

No bibliographic information available

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