Browsing Department of Informatics by Subject "Graphs and Networks"
Now showing items 1-1 of 1
-
Comparison of Discrete and Continuous Models for the Pooling Problem
(Chapter; Peer reviewed, 2011)The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branch-and-bound ...