piperout-27

benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack equation_knapsack integer_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	11659	18442	2.54224e-04	easy	piperout	8123.999999999973	piperout-27.mps.gz

Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	11659	9346
Constraints	18442	12571
Binaries	11514	9216
Integers	121	108
Continuous	24	22
Implicit Integers	0	28
Fixed Variables	19	0
Nonzero Density	0.000254224	0.000330781
Nonzeroes	54662	38863

Constraint Classification Properties
	Original	Presolved
Total	18442	12571
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	45	45
Precedence	6044	4619
Variable Bound	8160	5310
Set Partitioning	46	55
Set Packing	19	18
Set Covering	0	929
Cardinality	12	0
Invariant Knapsack	3961	1446
Equation Knapsack	2	2
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	3	5
Mixed Binary	12	8
General Linear	138	134
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.505150
Constraint %		0.0079500	3.15935	0.0079500	96.9772
Variable %		0.0195637	1.56857	0.0195637	47.5399
Score	0.518358

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

Similar instances in collection

The following instances are most similar to piperout-27 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
piperout-08	easy	10399	10245	130	24	14589	44959	Gleb Belov	piperout	125054.9999999999	benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack equation_knapsack integer_knapsack mixed_binary general_linear
piperout-03	easy	9526	9373	129	24	12246	39067	Gleb Belov	piperout	74981.99999999999	benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack equation_knapsack integer_knapsack mixed_binary general_linear
piperout-d27	easy	13104	12931	149	24	17470	224457	Gleb Belov	piperout	8124	decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear
supportcase17	easy	1381	732	235	414	2108	5253	Michael Winkler	–	1329.999999999999	benchmark_suitable aggregations precedence variable_bound set_partitioning mixed_binary general_linear
piperout-d20	easy	11961	11788	149	24	15562	190915	Gleb Belov	piperout	29948	decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear

Reference

@Inbook{Belov2017,
author="Belov, Gleb
and Garcia de la BAnda, Maria
and Czauderna, Tobias
and Wybrow, Michael
and Wallace, Mark",
editor="Rueher, Michel",
title="An Optimization Model for 3D Pipe Routing with Flexibility Constraints",
bookTitle="Principles and Practice of Constraint Programming: 23rd International Conference, CP 2017, Proceedings",
year="2017",
publisher="Springer International Publishing",
}