Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|
Daniel Bienstock | 13873 | 3202 | 1.79317e-03 | open | dano | 664.0208333333334* | dano3mip.mps.gz |
Telecommunications applications Imported from MIPLIB2010.
Detailed explanation of the following tables can be found here.
Original | Presolved | |
---|---|---|
Variables | 13873 | 13873 |
Constraints | 3202 | 3202 |
Binaries | 552 | 552 |
Integers | 0 | 0 |
Continuous | 13321 | 13321 |
Implicit Integers | 0 | 0 |
Fixed Variables | 0 | 0 |
Nonzero Density | 0.00179317 | 0.00179317 |
Nonzeroes | 79655 | 79655 |
Original | Presolved | |
---|---|---|
Total | 3202 | 3202 |
Empty | 0 | 0 |
Free | 0 | 0 |
Singleton | 0 | 0 |
Aggregations | 0 | 0 |
Precedence | 0 | 0 |
Variable Bound | 684 | 684 |
Set Partitioning | 0 | 0 |
Set Packing | 0 | 0 |
Set Covering | 0 | 0 |
Cardinality | 48 | 48 |
Invariant Knapsack | 0 | 0 |
Equation Knapsack | 0 | 0 |
Bin Packing | 0 | 0 |
Knapsack | 0 | 0 |
Integer Knapsack | 0 | 0 |
Mixed Binary | 2470 | 2470 |
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 | 2.74351 | ||||
Constraint % | 0.0312305 | 0.0386287 | 0.0312305 | 1.499060 | |
Variable % | 0.0144165 | 0.0159285 | 0.0144165 | 0.353204 | |
Score | 0.21353 |
Find solutions below. Download the archive containing all solutions from the Download page.
## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion
ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
---|---|---|---|---|---|---|---|---|
5 | 664.0208 | 664.0208 | 0 | 0 | 0 | Michael Winkler | 2022-07-16 | Found with the NoRel heuristic using the best-known solution from the MIPLIB website as MIP start running Gurobi version 9.5.1. |
4 | 665.5714 | 665.5714 | 0 | 0 | 0 | Yuji Shinano | 2020-04-16 | Obtained with ParaSCIP in 2014 |
3 | 667.5577 | 0 | 0 | 0 | Edward Rothberg | 2019-12-13 | Obtained with Gurobi 9.0 | |
2 | 676.5630 | 0 | 0 | 0 | Robert Ashford and Alkis Vazacopoulus | 2019-12-18 | Found using ODH|CPlex | |
1 | 691.8961 | 691.8961 | 0 | 0 | 0 | - | 2018-10-12 | Solution found during MIPLIB2017 problem selection. |
The following instances are most similar to dano3mip 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 |
---|---|---|---|---|---|---|---|---|---|---|---|
dano3_5 | easy | 13873 | 115 | 0 | 13758 | 3202 | 79655 | Daniel Bienstock | dano | 576.9249159565619 | benchmark benchmark_suitable variable_bound cardinality mixed_binary |
dano3_3 | easy | 13873 | 69 | 0 | 13804 | 3202 | 79655 | Daniel Bienstock | dano | 576.34463303 | benchmark benchmark_suitable variable_bound cardinality mixed_binary |
misc04inf | easy | 4897 | 30 | 0 | 4867 | 1726 | 17253 | MIPLIB submission pool | misc | Infeasible | infeasible aggregations precedence variable_bound set_packing mixed_binary general_linear |
ns1111636 | hard | 360822 | 13200 | 0 | 347622 | 13895 | 568444 | NEOS Server Submission | neos-pseudoapplication-67 | 162 | decomposition set_partitioning set_packing invariant_knapsack knapsack mixed_binary |
set3-09 | open | 4019 | 1424 | 0 | 2595 | 3747 | 13747 | Kerem Akartunali | set3 | 176497.15* | precedence variable_bound mixed_binary |
@article{GunlukBienstock1995,
author = {O. G{\"u}nl{\"u}k and D. Bienstock},
journal = {Mathematical Programming},
language = {English},
pages = {213-237},
title = {Computational experience with a difficult mixed-integer
multicommodity flow problem},
volume = {68},
year = {1995}
}