qnet1_o

decomposition aggregations precedence variable_bound set_partitioning cardinality general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
MIPLIB submission pool 1541 456 5.9969e-03 easy 16029.692681 qnet1_o.mps.gz

Imported from the MIPLIB2010 submissions.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 1541 1541
Constraints 456 456
Binaries 1288 1288
Integers 129 129
Continuous 124 124
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.0059969 0.0059969
Nonzeroes 4214 4214
Constraint Classification Properties
Original Presolved
Total 456 456
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 87 87
Precedence 32 32
Variable Bound 32 32
Set Partitioning 48 48
Set Packing 0 0
Set Covering 0 0
Cardinality 160 160
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 97 97
Indicator 0 0

Structure

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

value min median mean max
Components 1.681241
Constraint % 0.219298 1.67507 1.75439 5.48246
Variable % 0.129786 1.97440 2.79040 4.73718
Score 0.756681

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 16029.69 16029.69 0 4.6e-05 8.1e-05 - 2018-10-11 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to qnet1_o 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
qnet1 easy 1541 1288 129 124 503 4622 MIPLIB submission pool 16029.692681 aggregations precedence variable_bound set_partitioning set_covering cardinality general_linear
rococoB10-011000 easy 4456 4320 136 0 1667 16517 A. Chabrier, E. Danna, C. Le Pape, L. Perron rococo 19449 benchmark decomposition 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
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-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

Reference

No bibliographic information available

Last Update Okt 02, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint