neos-4360552-sangro

decomposition precedence variable_bound set_packing set_covering cardinality invariant_knapsack equation_knapsack binpacking knapsack integer_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Hans Mittelmann 10272 46012 6.3936e-04 open neos-pseudoapplication-62 -7* neos-4360552-sangro.mps.gz

Collection of anonymous submissions to the NEOS Server for Optimization

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 10272 10260
Constraints 46012 28378
Binaries 9696 9696
Integers 576 564
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000639360 0.000670728
Nonzeroes 302184 195288
Constraint Classification Properties
Original Presolved
Total 46012 28390
Empty 0 0
Free 0 0
Singleton 12 0
Aggregations 0 0
Precedence 4014 4008
Variable Bound 6912 6768
Set Partitioning 0 0
Set Packing 106 106
Set Covering 72 72
Cardinality 576 576
Invariant Knapsack 25584 8112
Equation Knapsack 48 48
Bin Packing 576 576
Knapsack 7536 7536
Integer Knapsack 0 12
Mixed Binary 0 0
General Linear 576 576
Indicator 0 0

Structure

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

value min median mean max
Components 1.740363
Constraint % 1.42364 1.76663 1.42364 4.51054
Variable % 1.26632 1.85077 1.26632 6.52640
Score 0.927663

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

Similar instances in collection

The following instances are most similar to neos-4360552-sangro 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-5178119-nalagi easy 4167 4068 0 99 6921 74476 Jeff Linderoth neos-pseudoapplication-62 22.73999999763 benchmark_suitable precedence set_partitioning set_packing set_covering cardinality invariant_knapsack knapsack mixed_binary general_linear
bnatt500 hard 4500 4500 0 0 7029 27203 Tatsuya Akutsu bnatt Infeasible benchmark infeasible binary benchmark_suitable precedence set_covering invariant_knapsack binpacking knapsack
bnatt400 easy 3600 3600 0 0 5614 21698 Tatsuya Akutsu bnatt 1 benchmark binary benchmark_suitable precedence set_covering invariant_knapsack binpacking knapsack
s1234 open 2945 2945 0 0 8418 44641 Siwei Sun SiweiSun 34* binary precedence set_covering invariant_knapsack binpacking knapsack
supportcase3 hard 4191 4191 0 0 12702 53470 Michael Winkler 0 binary feasibility aggregations precedence variable_bound invariant_knapsack knapsack mixed_binary

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