piperout-03

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 9526 12246 3.34892e-04 easy piperout 74981.99999999999 piperout-03.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 9526 7418
Constraints 12246 7915
Binaries 9373 7287
Integers 129 108
Continuous 24 23
Implicit Integers 0 28
Fixed Variables 12 0
Nonzero Density 0.000334892 0.000462092
Nonzeroes 39067 27131
Constraint Classification Properties
Original Presolved
Total 12246 7915
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 49 45
Precedence 3888 2634
Variable Bound 5831 3767
Set Partitioning 46 56
Set Packing 19 18
Set Covering 0 459
Cardinality 14 0
Invariant Knapsack 2242 785
Equation Knapsack 0 2
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 3
Mixed Binary 12 10
General Linear 145 136
Indicator 0 0

Structure

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

value min median mean max
Components 0.69897
Constraint % 0.1263420 22.94380 3.00695 85.6349
Variable % 0.0731707 9.78963 1.95122 35.1829
Score 0.61441

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

Similar instances in collection

The following instances are most similar to piperout-03 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-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
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
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

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