cvs08r139-94

binary decomposition benchmark_suitable precedence set_packing invariant_knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Michael Bastubbe	1864	2398	1.44434e-03	easy	cvs	-116	cvs08r139-94.mps.gz

Capacitated vertex separator problem on randomly generated hypergraph with 139 vertices and 94 hyperedges in at most 8 components each including at most 21 vertices.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	1864	1864
Constraints	2398	2398
Binaries	1864	1864
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.00144434	0.00144434
Nonzeroes	6456	6456

Constraint Classification Properties
	Original	Presolved
Total	2398	2398
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	2296	2296
Variable Bound	0	0
Set Partitioning	0	0
Set Packing	94	94
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	8	8
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.

Nonzero entries of original problem

Nonzero entries after trivial presolving

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

	value	min	median	mean	max
Components	1.397940
Constraint %		0.0834028	3.98944	0.125104	11.7598
Variable %		0.1609440	4.16667	0.214592	12.1245
Score	0.843367

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

Similar instances in collection

The following instances are most similar to cvs08r139-94 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	Constraints	Nonz.	Submitter	Group	Objective	Tags
cvs16r89-60	easy	2384	2384	3068	8368	Michael Bastubbe	cvs	-65	binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
cvs16r106-72	easy	2848	2848	3608	9888	Michael Bastubbe	cvs	-81	binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
cvs16r128-89	easy	3472	3472	4633	12528	Michael Bastubbe	cvs	-97	benchmark binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
cvs16r70-62	easy	2112	2112	3278	8512	Michael Bastubbe	cvs	-42	binary decomposition benchmark_suitable precedence set_packing invariant_knapsack
neos-953928	easy	23305	23305	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