neos-3355323-arnon

no_solution feasibility aggregations precedence set_covering invariant_knapsack binpacking general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Jeff Linderoth 10248 21216 3.2155e-04 open neos-pseudoapplication-38 NA neos-3355323-arnon.mps.gz

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 10248 10248
Constraints 21216 21216
Binaries 10104 10104
Integers 144 144
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00032155 0.00032155
Nonzeroes 69912 69912
Constraint Classification Properties
Original Presolved
Total 21216 21216
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 60 60
Precedence 120 120
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 36
Cardinality 0 0
Invariant Knapsack 1284 1248
Equation Knapsack 0 0
Bin Packing 468 468
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 19284 19284
Indicator 0 0

Structure

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

value min median mean max
Components 1.591065
Constraint % 0.004760 2.41679 0.004760 45.9475
Variable % 0.126854 2.61617 0.126854 47.5410
Score 0.483655

Best Known Solution(s)

No solution available for neos-3355323-arnon .

Similar instances in collection

The following instances are most similar to neos-3355323-arnon 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-3603137-hoteo open 4003 3913 90 0 10510 39146 Jeff Linderoth neos-pseudoapplication-38 no_solution feasibility aggregations set_covering invariant_knapsack knapsack 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
no-ip-65059 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