neos-3211096-shag

infeasible feasibility aggregations precedence variable_bound set_covering invariant_knapsack binpacking mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Jeff Linderoth 4379 10187 7.10733e-04 hard neos-pseudoapplication-38 Infeasible neos-3211096-shag.mps.gz

Solved with status infeasible by ParaSCIP in 42484 sec. It was confirmed by ParaXpress.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 4379 4379
Constraints 10187 10187
Binaries 4289 4289
Integers 90 90
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000710733 0.000710733
Nonzeroes 31705 31705
Constraint Classification Properties
Original Presolved
Total 10187 10187
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 36 36
Precedence 72 72
Variable Bound 896 896
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 20
Cardinality 0 0
Invariant Knapsack 596 576
Equation Knapsack 0 0
Bin Packing 0 320
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 640 320
General Linear 7947 7947
Indicator 0 0

Structure

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

value min median mean max
Components 1.322219
Constraint % 0.040008 1.09222 0.040008 10.5621
Variable % 0.114181 1.82462 0.114181 17.2185
Score 0.182063

Best Known Solution(s)

No solution available for neos-3211096-shag .

Similar instances in collection

The following instances are most similar to neos-3211096-shag 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-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
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-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 Apr 09, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint