neos-850681

benchmark_suitable aggregations variable_bound set_partitioning set_packing invariant_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
NEOS Server Submission 2594 2067 6.92175e-03 easy neos-pseudoapplication-12 2472 neos-850681.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 2594 2594
Constraints 2067 2067
Binaries 2479 2479
Integers 16 115
Continuous 99 0
Implicit Integers 0 99
Fixed Variables 0 0
Nonzero Density 0.00692175 0.00692175
Nonzeroes 37113 37113
Constraint Classification Properties
Original Presolved
Total 2067 2067
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 90 90
Precedence 0 0
Variable Bound 1 1
Set Partitioning 354 354
Set Packing 1003 1003
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 504 504
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 99 0
General Linear 16 115
Indicator 0 0

Structure

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

value min median mean max
Components 1.662758
Constraint % 0.483793 1.17615 1.35462 1.35462
Variable % 0.424056 1.96608 2.31303 2.46723
Score 0.517635

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

Similar instances in collection

The following instances are most similar to neos-850681 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
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
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
neos-498623 easy 9861 8500 0 1361 2047 148434 NEOS Server Submission neos-pseudoapplication-5 16.6 benchmark_suitable aggregations variable_bound set_partitioning set_packing mixed_binary general_linear
neos-4409277-trave hard 14363 14362 0 1 7875 204518 Jeff Linderoth neos-pseudoapplication-47 3 variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack mixed_binary

Reference

No bibliographic information available

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