44 citations · 263 across the 29 of their papers we have counts for
Showing 2015 · math.OCShow all
2 papers · 2 filters
math.OC2015★ 10 cited
A polynomially solvable case of the pooling problem
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of l…
math.OC2015★ 31 cited
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
Natashia Boland, Santanu S. Dey, Thomas Kalinowski +2
We investigate how well the graph of a bilinear function can be approximated by its McCormick relaxation. In particular, we are interested in the smallest…