neos-578379

binary feasibility benchmark_suitable aggregations variable_bound set_partitioning set_packing cardinality

Submitter Variables Constraints Density Status Group Objective MPS File
NEOS Server Submission 17010 21703 2.75105e-04 easy neos-pseudoapplication-42 0 neos-578379.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 17010 17010
Constraints 21703 21703
Binaries 17010 17010
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000275105 0.000275105
Nonzeroes 101560 101560
Constraint Classification Properties
Original Presolved
Total 21703 21703
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 4290 4290
Precedence 0 0
Variable Bound 4288 4288
Set Partitioning 1190 2262
Set Packing 6432 6432
Set Covering 0 0
Cardinality 5503 4431
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 0 0
Indicator 0 0

Structure

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

value min median mean max
Components 1.491362
Constraint % 0.0092200 2.14265 1.23508 7.41048
Variable % 0.0294083 2.51833 1.18810 8.75779
Score 0.607183

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

Similar instances in collection

The following instances are most similar to neos-578379 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-5125849-lopori easy 8130 8040 90 0 453 20938 Jeff Linderoth neos-pseudoapplication-42 0 feasibility benchmark_suitable aggregations set_partitioning set_packing equation_knapsack general_linear
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
cryptanalysiskb128n5obj14 hard 48950 47830 1120 0 98021 292875 Gleb Belov cryptanalysis Infeasible benchmark infeasible feasibility benchmark_suitable aggregations precedence variable_bound set_covering cardinality invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear
cryptanalysiskb128n5obj16 easy 48950 47830 1120 0 98021 292875 Gleb Belov cryptanalysis 0 benchmark feasibility benchmark_suitable aggregations precedence variable_bound set_covering cardinality invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear
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

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