vpphard2

binary decomposition benchmark_suitable set_partitioning cardinality invariant_knapsack

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
C. Cardonha	199999	198450	1.63352e-05	easy	–	81	vpphard2.mps.gz

Vehicle positioning problem instance. Solved using CPLEX 12.4 in 43987 seconds (May 2012). Solved using Gurobi 5.6.2 in 124 seconds (May 2014).Solved using CPLEX 12.6 in 225 seconds (May 2014). Imported from MIPLIB2010.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	199999	139234
Constraints	198450	136760
Binaries	199999	139234
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	1.63352e-05	2.99166e-05
Nonzeroes	648340	569661

Constraint Classification Properties
	Original	Presolved
Total	198450	136760
Empty	925	0
Free	0	0
Singleton	42851	0
Aggregations	0	0
Precedence	17914	0
Variable Bound	0	0
Set Partitioning	592	592
Set Packing	0	0
Set Covering	0	0
Cardinality	333	333
Invariant Knapsack	135835	135835
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.579784
Constraint %		1.08307	2.69098	3.26826	3.65518
Variable %		1.10246	2.70270	3.27865	3.66290
Score	0.965230

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

Similar instances in collection

The following instances are most similar to vpphard2 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	Constraints	Nonz.	Submitter	Group	Objective	Tags
vpphard	easy	51471	51471	0	47280	372305	C. Cardonha	–	5	binary decomposition benchmark_suitable set_partitioning cardinality invariant_knapsack
tanglegram4	easy	56048	56048	0	110404	331212	Falk Hueffner	huefner	10696	binary benchmark_suitable set_covering invariant_knapsack
tanglegram6	easy	9182	9182	0	17712	53136	Falk Hueffner	huefner	1224	binary benchmark_suitable set_covering invariant_knapsack
toll-like	easy	2883	2883	0	4408	13224	Falk Hueffner	huefner	610	binary benchmark_suitable set_covering invariant_knapsack
neos-950242	easy	5760	5520	240	34224	104160	NEOS Server Submission	neos-pseudoapplication-72	4	benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_covering invariant_knapsack general_linear

Reference

No bibliographic information available