A dynamic adaptive discretisation algorithm for the pooling problem

Akshay Gupte; Arie M.C.A.  Koster; Sascha  Kuhnke

A dynamic adaptive discretisation algorithm for the pooling problem

Akshay Gupte, Arie M.C.A. Koster, Sascha Kuhnke

School of Mathematics

Research output: Contribution to conference › Paper › peer-review

Abstract / Description of output

In this talk, we present an iterative algorithm based on discretization to calculate high quality solutions for the pooling problem in reasonable running time. The pooling problem was first introduced by Haverly (1978). This problem has important applications in industries such as refinery processes in the petroleum industry, wastewater treatment or gas transportation planning. In the pooling problem, a flow network (N,A) is given where the set of nodes N can be

Original language	English
Number of pages	2
Publication status	Published - Jun 2019
Event	International Network Optimization Conference 2019 (INOC 2019) - Avignon, France Duration: 12 Jun 2019 → 14 Jun 2019

Conference

Conference	International Network Optimization Conference 2019 (INOC 2019)
Country/Territory	France
City	Avignon
Period	12/06/19 → 14/06/19

Access to Document

A Dynamic Adaptive Discretization Algorithm for theAccepted author manuscript, 153 KB

Cite this

@conference{71a297c8c0d84d618d5434e084bff9bf,

title = "A dynamic adaptive discretisation algorithm for the pooling problem",

abstract = "In this talk, we present an iterative algorithm based on discretization to calculate high quality solutions for the pooling problem in reasonable running time. The pooling problem was first introduced by Haverly (1978). This problem has important applications in industries such as refinery processes in the petroleum industry, wastewater treatment or gas transportation planning. In the pooling problem, a flow network (N,A) is given where the set of nodes N can be ",

author = "Akshay Gupte and Koster, {Arie M.C.A.} and Sascha Kuhnke",

year = "2019",

month = jun,

language = "English",

note = "International Network Optimization Conference 2019 (INOC 2019) ; Conference date: 12-06-2019 Through 14-06-2019",

}

TY - CONF

T1 - A dynamic adaptive discretisation algorithm for the pooling problem

AU - Gupte, Akshay

AU - Koster, Arie M.C.A.

AU - Kuhnke, Sascha

PY - 2019/6

Y1 - 2019/6

N2 - In this talk, we present an iterative algorithm based on discretization to calculate high quality solutions for the pooling problem in reasonable running time. The pooling problem was first introduced by Haverly (1978). This problem has important applications in industries such as refinery processes in the petroleum industry, wastewater treatment or gas transportation planning. In the pooling problem, a flow network (N,A) is given where the set of nodes N can be

AB - In this talk, we present an iterative algorithm based on discretization to calculate high quality solutions for the pooling problem in reasonable running time. The pooling problem was first introduced by Haverly (1978). This problem has important applications in industries such as refinery processes in the petroleum industry, wastewater treatment or gas transportation planning. In the pooling problem, a flow network (N,A) is given where the set of nodes N can be

M3 - Paper

T2 - International Network Optimization Conference 2019 (INOC 2019)

Y2 - 12 June 2019 through 14 June 2019

ER -

A dynamic adaptive discretisation algorithm for the pooling problem

Abstract / Description of output

Conference

Access to Document

Fingerprint

Cite this