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.
Detailed explanation of the following tables can be found here.
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 |
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 |
Available nonzero structure and decomposition information. Further information can be found here.
Decomposed structure of original problem (dec-file)
Decomposed structure after trivial presolving (dec-file)
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 |
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. |
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.
@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}
}