Blar i Department of Informatics på emneord "Graphs and Networks"
Viser treff 1-1 av 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 ...