Nanocomposite hydrogels based on carbon nanotubes (CNTs) are known to possess
remarkable stiffness, electrical, and thermal conductivity. However, they often make use of …

The pooling problem is a folklore NP-hard global optimization problem that finds
applications in industries such as petrochemical refining, wastewater treatment and mining …

We analyze the computational complexity of the synthesis problem of decentralized energy
systems. This synthesis problem consists of combining various types of energy conversion …

Designing and analyzing algorithms with provable performance guarantees enables
efficient optimization problem solving in different application domains, eg communication …

We investigate new convex relaxations for the pooling problem, a classic nonconvex
production planning problem in which input materials are mixed in intermediate pools, with …

The standard pooling problem is a NP-hard subclass of non-convex quadratically-
constrained optimization problems that commonly arises in process systems engineering …

We study sets defined as the intersection of a rank-one constraint with different choices of
linear side constraints. We identify different conditions on the linear side constraints, under …

Discretization-based methods have been proposed for solving nonconvex optimization
problems with bilinear terms such as the pooling problem. These methods convert the …

Branch‐and‐cut optimization solvers typically apply generic algorithms, eg, cutting planes or
primal heuristics, to expedite performance for many mathematical optimization problems. But …

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 …