p0201

binary set_packing set_covering invariant_knapsack knapsack mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
MIPLIB submission pool 201 133 7.19336e-02 easy pfour 7614.999999999997 p0201.mps.gz

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 201 195
Constraints 133 133
Binaries 201 195
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.0719336 0.0716021
Nonzeroes 1923 1857
Constraint Classification Properties
Original Presolved
Total 133 133
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 26 26
Set Covering 0 20
Cardinality 0 0
Invariant Knapsack 74 54
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 33 3
Integer Knapsack 0 0
Mixed Binary 0 30
General Linear 0 0
Indicator 0 0

Structure

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

value min median mean max
Components 0.7781512
Constraint % 0.75188 15.4887 0.75188 37.5940
Variable % 2.56410 20.0000 2.56410 46.1538
Score 0.4268360

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

Similar instances in collection

The following instances are most similar to p0201 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-932721 easy 22266 21825 0 441 18085 107908 NEOS Server Submission neos-pseudoapplication-56 52030 decomposition precedence variable_bound set_packing invariant_knapsack mixed_binary
neos-3696678-lyvia easy 7683 7516 167 0 9004 30452 Jeff Linderoth neos-pseudoapplication-56 83.74999995899876 decomposition variable_bound set_covering cardinality invariant_knapsack mixed_binary general_linear
mitre easy 10724 10724 0 0 2054 39704 MIPLIB submission pool 115154.9999999991 binary decomposition set_partitioning set_covering invariant_knapsack mixed_binary
neos-3581454-haast easy 8112 7512 0 600 17220 92976 Jeff Linderoth neos-pseudoapplication-14 2295 decomposition benchmark_suitable precedence variable_bound set_partitioning set_packing invariant_knapsack knapsack mixed_binary
neos18 easy 3312 3312 0 0 11402 24614 NEOS Server Submission neos-pseudoapplication-49 16 binary decomposition benchmark_suitable precedence variable_bound set_covering invariant_knapsack

Reference

No bibliographic information available

Last Update 2024 by Mark Turner
generated with R Markdown
© by Zuse Institute Berlin (ZIB)
Imprint