neos-3603137-hoteo

no_solution feasibility aggregations set_covering invariant_knapsack knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Jeff Linderoth 4003 10510 9.30463e-04 open neos-pseudoapplication-38 NA neos-3603137-hoteo.mps.gz

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 4003 4003
Constraints 10510 10510
Binaries 3913 3913
Integers 90 90
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000930463 0.000930463
Nonzeroes 39146 39146
Constraint Classification Properties
Original Presolved
Total 10510 10510
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 36 36
Precedence 0 0
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 0 0
Set Covering 2304 20
Cardinality 0 0
Invariant Knapsack 468 2752
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 160 160
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 7542 7542
Indicator 0 0

Structure

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

value min median mean max
Components 1.770852
Constraint % 0.0096600 0.233262 0.0096600 6.18477
Variable % 0.0499625 1.164640 0.0499625 18.48610
Score 0.119076

Best Known Solution(s)

No solution available for neos-3603137-hoteo .

Similar instances in collection

The following instances are most similar to neos-3603137-hoteo 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-3211096-shag hard 4379 4289 90 0 10187 31705 Jeff Linderoth neos-pseudoapplication-38 Infeasible infeasible feasibility aggregations precedence variable_bound set_covering invariant_knapsack binpacking mixed_binary general_linear
neos-3355323-arnon open 10248 10104 144 0 21216 69912 Jeff Linderoth neos-pseudoapplication-38 no_solution feasibility aggregations precedence set_covering invariant_knapsack binpacking general_linear
no-ip-65059 easy 2232 2187 45 0 2547 13590 Christopher Hojny noip Infeasible infeasible feasibility decomposition benchmark_suitable precedence set_covering general_linear
no-ip-64999 easy 2232 2187 45 0 2547 13590 Christopher Hojny noip Infeasible infeasible feasibility decomposition benchmark_suitable precedence set_covering general_linear
lectsched-3 easy 25776 25319 457 0 45262 279967 Harald Schilly lectsched 0 feasibility benchmark_suitable aggregations precedence variable_bound integer_knapsack general_linear

Reference

No bibliographic information available

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