rococoB10-011000

benchmark decomposition benchmark_suitable precedence set_partitioning cardinality general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
A. Chabrier, E. Danna, C. Le Pape, L. Perron 4456 1667 2.22357e-03 easy rococo 19449 rococoB10-011000.mps.gz

Model for dimensioning the arc capacities in a telecommunication network Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 4456 3646
Constraints 1667 856
Binaries 4320 3510
Integers 136 136
Continuous 0 0
Implicit Integers 0 98
Fixed Variables 0 0
Nonzero Density 0.00222357 0.00455851
Nonzeroes 16517 14227
Constraint Classification Properties
Original Presolved
Total 1667 856
Empty 0 0
Free 0 0
Singleton 811 0
Aggregations 0 0
Precedence 180 180
Variable Bound 0 0
Set Partitioning 90 90
Set Packing 0 0
Set Covering 0 0
Cardinality 360 360
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 226 226
Indicator 0 0

Structure

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

value min median mean max
Components 1.959041
Constraint % 0.817757 0.992991 0.992991 1.16822
Variable % 0.216743 1.097260 1.097260 1.97778
Score 0.882497

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
2 19449 19449 0 0 0 - 2018-10-29 Solution found during MIPLIB2017 problem selection.
1 19449 19449 0 0 0 - 2018-10-13 Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to rococoB10-011000 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
rococoC10-001000 easy 3117 2993 124 0 1293 11751 A. Chabrier, E. Danna, C. Le Pape, L. Perron rococo 11460 benchmark benchmark_suitable precedence set_partitioning cardinality general_linear
rococoC11-011100 easy 6491 6325 166 0 2367 30472 A. Chabrier, E. Danna, C. Le Pape, L. Perron rococo 20889 decomposition benchmark_suitable aggregations precedence set_partitioning cardinality invariant_knapsack general_linear
rococoC11-010100 hard 12321 12155 166 0 4010 46955 A. Chabrier, E. Danna, C. Le Pape, L. Perron rococo 20889 decomposition aggregations precedence set_partitioning cardinality invariant_knapsack general_linear
qnet1_o easy 1541 1288 129 124 456 4214 MIPLIB submission pool 16029.692681 decomposition aggregations precedence variable_bound set_partitioning cardinality general_linear
qnet1 easy 1541 1288 129 124 503 4622 MIPLIB submission pool 16029.69268099998 aggregations precedence variable_bound set_partitioning set_covering cardinality general_linear

Reference

@article{ChabrierDannaLePapePerron2004,
 author = {Alain Chabrier and Emilie Danna and Claude Le~Pape and
Laurent Perron},
 issue = {1-4},
 journal = {Annals of Operations Research},
 language = {English},
 pages = {217--239},
 title = {Solving a network design problem},
 volume = {130},
 year = {2004}
}

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