qiu

benchmark_suitable precedence variable_bound mixed_binary

Submitter Variables Constraints Density Status Group Objective MPS File
Y. Chiu, J. Eckstein 840 1192 3.42761e-03 easy -132.87313695 qiu.mps.gz

Fiber-optic network design, logical SONET ring level Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 840 840
Constraints 1192 1192
Binaries 48 48
Integers 0 0
Continuous 792 792
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00342761 0.00342761
Nonzeroes 3432 3432
Constraint Classification Properties
Original Presolved
Total 1192 1192
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 528 528
Variable Bound 528 528
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 136 136
General Linear 0 0
Indicator 0 0

Structure

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

value min median mean max
Components 0.698970
Constraint % 22.2315 22.2315 22.2315 22.2315
Variable % 25.0000 25.0000 25.0000 25.0000
Score 0.666946

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 -132.8731 -132.8731 0 0 0 - 2018-10-12 Solution imported from MIPLIB2010.
1 -132.8731 -132.8731 0 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to qiu 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
supportcase37 easy 20047 1484 0 18563 59023 135627 Domenico Salvagnin -1048.96 benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing invariant_knapsack mixed_binary
supportcase40 easy 16440 2000 0 14440 38192 104420 Domenico Salvagnin 24256.3122898 benchmark decomposition benchmark_suitable precedence variable_bound set_packing mixed_binary
neos-1396125 easy 1161 129 0 1032 1494 5511 NEOS Server Submission neos-pseudoapplication-96 3000.0453373 benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack knapsack mixed_binary
gus-sch easy 5475 2736 2736 3 5984 33135 Alexandra M. Newman -1167 decomposition aggregations precedence variable_bound set_packing set_covering cardinality invariant_knapsack integer_knapsack mixed_binary general_linear
neos-3759587-noosa easy 27029 4289 0 22740 72104 318169 Jeff Linderoth neos-pseudoapplication-61 48.334467769 benchmark_suitable precedence variable_bound set_partitioning set_packing invariant_knapsack binpacking knapsack mixed_binary

Reference

@inproceedings{Eckstein1994a,
 author = {J. Eckstein},
 booktitle = {Proceedings of Supercomputing 1994},
 instance = {qiu},
 language = {English},
 pages = {41--48},
 publisher = {IEEE Computer Society Press},
 title = {Control Strategies for Parallel Mixed Integer Branch and Bound},
 year = {1994}
}

@article{Eckstein1994b,
 author = {J. Eckstein},
 instance = {qiu},
 journal = {SIAM Journal on Optimization},
 language = {English},
 number = {4},
 pages = {794--814},
 title = {Parallel Branch-and-Bound Methods for Mixed Integer
Programming on the {CM}-5},
 volume = {4},
 year = {1994}
}

@article{Eckstein1994c,
 author = {J. Eckstein},
 instance = {qiu},
 journal = {SIAM News},
 language = {English},
 number = {1},
 pages = {12--15},
 title = {Parallel Branch-and-Bound Methods for Mixed Integer Programming},
 volume = {27},
 year = {1994}
}

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