cvs16r89-60

binary decomposition benchmark_suitable precedence set_packing invariant_knapsack

Submitter Variables Constraints Density Status Group Objective MPS File
Michael Bastubbe 2384 3068 1.14409e-03 easy cvs -65 cvs16r89-60.mps.gz

Capacitated vertex separator problem on randomly generated hypergraph with 89 vertices and 60 hyperedges in at most 16 components each including at most 6 vertices.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 2384 2384
Constraints 3068 3068
Binaries 2384 2384
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00114409 0.00114409
Nonzeroes 8368 8368
Constraint Classification Properties
Original Presolved
Total 3068 3068
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 2992 2992
Variable Bound 0 0
Set Partitioning 0 0
Set Packing 60 60
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 16 16
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.230449
Constraint % 6.12777 6.12777 6.12777 6.12777
Variable % 6.25000 6.25000 6.25000 6.25000
Score 0.919166

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

Similar instances in collection

The following instances are most similar to cvs16r89-60 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
cvs16r106-72 easy 2848 2848 0 0 3608 9888 Michael Bastubbe cvs -81 binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
cvs16r128-89 easy 3472 3472 0 0 4633 12528 Michael Bastubbe cvs -97 benchmark binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
cvs16r70-62 easy 2112 2112 0 0 3278 8512 Michael Bastubbe cvs -42 binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
cvs08r139-94 easy 1864 1864 0 0 2398 6456 Michael Bastubbe cvs -116 binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
neos-953928 easy 23305 23305 0 0 12498 169861 NEOS Server Submission neos-pseudoapplication-13 -99.9044444446 binary decomposition benchmark_suitable precedence set_packing invariant_knapsack binpacking knapsack

Reference

No bibliographic information available

Last Update Jun 24, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint