Name
Abstract | ||
|---|---|---|
The pooling problem is a well-studied global optimization problem with applications in oil refining and petrochemical industry. Despite the strong NP-hardness of the problem, which is proved formally in this paper, most instances from the literature have recently been solved efficiently by use of strong formulations. The main contribution from this paper is a new formulation that proves to be stronger than other formulations based on proportion variables. Moreover, we propose a promising branching strategy for the new formulation and provide computational experiments confirming the strength of the new formulation and the effectiveness of the branching strategy. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10898-012-9875-6 | J. Global Optimization |
Keywords | Field | DocType |
Pooling problem,Bilinear programming,Global optimization,Linear relaxation,Computational complexity | Mathematical optimization,Global optimization,Pooling,Mathematics,Computational complexity theory,Branching (version control),Oil refinery,Global optimization problem | Journal |
Volume | Issue | ISSN |
56 | 3 | 0925-5001 |
Citations | PageRank | References |
21 | 1.00 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammed Alfaki | 1 | 37 | 2.41 |
| Dag Haugland | 2 | 151 | 15.18 |