mzzv42z

benchmark benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
MIPLIB submission pool 11717 10460 1.23418e-03 easy -20540 mzzv42z.mps.gz

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 11717 11717
Constraints 10460 10460
Binaries 11482 11482
Integers 235 235
Continuous 0 0
Implicit Integers 0 42
Fixed Variables 0 0
Nonzero Density 0.00123418 0.00123418
Nonzeroes 151261 151261
Constraint Classification Properties
Original Presolved
Total 10460 10460
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 4 4
Variable Bound 82 82
Set Partitioning 2157 2157
Set Packing 5680 5680
Set Covering 0 0
Cardinality 2262 2262
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 275 275
Indicator 0 0

Structure

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

value min median mean max
Components 1.819544
Constraint % 0.0095600 0.848066 0.0191205 8.39388
Variable % 0.0170692 0.819191 0.0170692 8.38952
Score 0.534106

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 -20540 -20540 0 0 0 - 2018-10-11 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to mzzv42z 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
mzzv11 easy 10240 9989 251 0 9499 134603 S. Lukac -21718 benchmark benchmark_suitable variable_bound set_partitioning set_packing cardinality invariant_knapsack knapsack 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 57.99999999999999 benchmark benchmark_suitable set_partitioning set_packing cardinality invariant_knapsack general_linear
bab1 hard 61152 61152 0 0 60680 854392 Elmar Swarat, Laura Traverso, Julia Buwaya bab -218764.88525 binary decomposition aggregations set_packing set_covering cardinality invariant_knapsack knapsack mixed_binary

Reference

No bibliographic information available

Last Update 2024 by Julian Manns
generated with R Markdown
© by Zuse Institute Berlin (ZIB)
Imprint