no-ip-64999

infeasible feasibility decomposition benchmark_suitable precedence set_covering general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Christopher Hojny 2232 2547 2.39054e-03 easy noip Infeasible no-ip-64999.mps.gz

integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 2232 2232
Constraints 2547 2538
Binaries 2187 2187
Integers 45 45
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00239054 0.00239743
Nonzeroes 13590 13581
Constraint Classification Properties
Original Presolved
Total 2547 2538
Empty 0 0
Free 0 0
Singleton 9 0
Aggregations 0 0
Precedence 27 27
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 0 0
Set Covering 243 243
Cardinality 0 0
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 2268 2268
Indicator 0 0

Structure

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

value min median mean max
Components 1.000000
Constraint % 10.0473 10.0473 10.0473 10.0473
Variable % 11.1111 11.1111 11.1111 11.1111
Score 0.803783

Best Known Solution(s)

No solution available for no-ip-64999 .

Similar instances in collection

The following instances are most similar to no-ip-64999 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
no-ip-65059 easy 2232 2187 45 0 2547 13590 Christopher Hojny noip Infeasible infeasible feasibility decomposition benchmark_suitable precedence set_covering general_linear
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
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
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 Jul 31, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint