A dynamic adaptive discretisation algorithm for the pooling problem

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

Research output: Contribution to conferenceAbstractpeer-review

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
Original languageEnglish
Number of pages2
Publication statusPublished - Jun 2019
EventInternational Network Optimization Conference 2019 (INOC 2019) - Avignon, France
Duration: 12 Jun 201914 Jun 2019

Conference

ConferenceInternational Network Optimization Conference 2019 (INOC 2019)
CountryFrance
CityAvignon
Period12/06/1914/06/19

Fingerprint

Dive into the research topics of 'A dynamic adaptive discretisation algorithm for the pooling problem'. Together they form a unique fingerprint.

Cite this