circ10-3

binary decomposition precedence variable_bound set_partitioning set_packing invariant_knapsack knapsack mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
M. Winkler 2700 42620 2.67063e-03 open 280* circ10-3.mps.gz

Instance from the 2010 SAT conference pseudo-Boolean competition Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 2700 2700
Constraints 42620 42620
Binaries 2700 2700
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00267063 0.00267063
Nonzeroes 307320 307320
Constraint Classification Properties
Original Presolved
Total 42620 42620
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 1800 1800
Variable Bound 1530 1530
Set Partitioning 450 450
Set Packing 0 180
Set Covering 16890 0
Cardinality 0 0
Invariant Knapsack 0 17040
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 21600
Integer Knapsack 0 0
Mixed Binary 21950 20
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.041393
Constraint % 9.17644 9.17644 9.17644 9.17644
Variable % 10.00000 10.00000 10.00000 10.00000
Score 0.825880

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion
ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
3 280 280 0 0 0 Ed Klotz 2020-08-17 Obtained with Gurobi.
2 284 0 0 0 Ed Klotz 2019-09-26 Obtained with ODH
1 378 378 0 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to circ10-3 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
s1234 hard 2945 2945 0 0 8418 44641 Siwei Sun SiweiSun 29 binary precedence set_covering invariant_knapsack binpacking knapsack
bnatt500 hard 4500 4500 0 0 7029 27203 Tatsuya Akutsu bnatt Infeasible benchmark infeasible binary benchmark_suitable precedence set_covering invariant_knapsack binpacking knapsack
bnatt400 easy 3600 3600 0 0 5614 21698 Tatsuya Akutsu bnatt 1 benchmark binary benchmark_suitable precedence set_covering invariant_knapsack binpacking knapsack
bley_xl1 easy 5831 5831 0 0 175620 869391 A. Bley bley_x 190 binary numerics aggregations variable_bound set_partitioning set_packing cardinality invariant_knapsack binpacking knapsack mixed_binary
neos-5178119-nalagi easy 4167 4068 0 99 6921 74476 Jeff Linderoth neos-pseudoapplication-62 22.73999999763 benchmark_suitable precedence set_partitioning set_packing set_covering cardinality invariant_knapsack knapsack mixed_binary general_linear

Reference

@misc{pseudoboolean,
 key = {pseudoboolean},
 note = {http://www.cril.univ-artois.fr/PB10/},
 title = {{P}seudo-{B}oolean {C}ompetition 2010},
 year = {2010}
}

Last Update Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint