bab2

benchmark binary decomposition benchmark_suitable aggregations set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Elmar Swarat	147912	17245	7.94955e-04	hard	bab	-357544.3115	bab2.mps.gz

Vehicle Routing with profits and an integrated crew scheduling formulated by two coupled multi-commodity flow problems. Imported from the MIPLIB2010 submissions.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	147912	146248
Constraints	17245	17007
Binaries	147912	146248
Integers	0	0
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.000794955	0.000813331
Nonzeroes	2027730	2022950

Constraint Classification Properties
	Original	Presolved
Total	17245	17007
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	52	4
Precedence	0	0
Variable Bound	0	0
Set Partitioning	1337	1481
Set Packing	308	296
Set Covering	0	6
Cardinality	2096	1904
Invariant Knapsack	12216	12112
Equation Knapsack	1072	1072
Bin Packing	0	0
Knapsack	36	8
Integer Knapsack	0	0
Mixed Binary	128	124
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	2.193125
Constraint %		0.1999180	0.572364	0.611513	2.23437
Variable %		0.0622231	0.643926	0.238636	8.49516
Score	0.871287

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

Similar instances in collection

The following instances are most similar to bab2 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
bab5	easy	21600	21600	4964	155520	Elmar Swarat	bab	-106411.8401	binary decomposition benchmark_suitable aggregations set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary
bab3	open	393800	393800	23069	3301838	Elmar Swarat	bab	-656214.9542*	binary decomposition aggregations set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary
bab6	hard	114240	114240	29904	1283181	Elmar Swarat	bab	-284248.2307000001	benchmark binary benchmark_suitable aggregations precedence set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack knapsack mixed_binary
neos-3555904-turama	easy	37461	37461	146493	793605	Hans Mittelmann	neos-pseudoapplication-81	-34.7	benchmark binary benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack
n2seq36q	easy	22480	22480	2565	183292	R. Meirich	nseq	52200	benchmark binary benchmark_suitable set_packing set_covering invariant_knapsack binpacking knapsack

Reference

No bibliographic information available