neos-1330346

binary decomposition benchmark_suitable aggregations precedence variable_bound cardinality

Submitter Variables Constraints Density Status Group Objective MPS File
NEOS Server Submission 2664 4248 1.15158e-03 easy neos-pseudoapplication-49 8 neos-1330346.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 2664 2664
Constraints 4248 4248
Binaries 2664 2664
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00115158 0.00115158
Nonzeroes 13032 13032
Constraint Classification Properties
Original Presolved
Total 4248 4248
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 36 36
Precedence 2592 2592
Variable Bound 1296 1296
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 324 324
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 0 0
Indicator 0 0

Structure

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

value min median mean max
Components 1.568202
Constraint % 2.56591 2.56591 2.56591 2.56591
Variable % 2.77778 2.77778 2.77778 2.77778
Score 0.898070

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

Similar instances in collection

The following instances are most similar to neos-1330346 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
acc-tight4 easy 1620 1620 0 0 3285 17073 J. Walser acc-tight 0 binary benchmark_suitable precedence set_partitioning set_packing set_covering cardinality invariant_knapsack mixed_binary
acc-tight5 easy 1339 1339 0 0 3052 16134 J. Walser acc-tight 0 binary benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack mixed_binary
acc-tight2 easy 1620 1620 0 0 2520 15327 J. Walser acc-tight 0 binary benchmark_suitable precedence set_partitioning set_packing set_covering cardinality invariant_knapsack
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
neos-3148108-pahi easy 12241 12241 0 0 154774 353504 Jeff Linderoth neos-pseudoapplication-49 0 binary decomposition aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack binpacking knapsack

Reference

No bibliographic information available

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