piperout-d27

decomposition benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack binpacking knapsack integer_knapsack mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 13104 17470 9.80475e-04 easy piperout 8124 piperout-d27.mps.gz

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

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 13104 11959
Constraints 17470 16196
Binaries 12931 11803
Integers 149 133
Continuous 24 23
Implicit Integers 0 6
Fixed Variables 19 0
Nonzero Density 0.000980475 0.000997284
Nonzeroes 224457 193162
Constraint Classification Properties
Original Presolved
Total 17470 16196
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 247 247
Precedence 7226 7061
Variable Bound 111 111
Set Partitioning 92 4210
Set Packing 19 18
Set Covering 0 1636
Cardinality 4570 0
Invariant Knapsack 4889 2601
Equation Knapsack 0 0
Bin Packing 7 7
Knapsack 17 5
Integer Knapsack 3 4
Mixed Binary 12 22
General Linear 277 274
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 1.591065
Constraint % 0.0061800 2.32132 2.76062 8.46097
Variable % 0.0166945 2.62411 3.02170 10.13360
Score 0.847019

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-d27 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-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
piperout-27 easy 11659 11514 121 24 18442 54662 Gleb Belov piperout 8123.999999999973 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-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
neos-555001 easy 3855 3782 73 0 3474 16649 NEOS Server Submission neos-pseudoapplication-94 1210625 decomposition numerics aggregations precedence set_partitioning invariant_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",
}

Last Update Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint