Pages that link to "Item:Q5964238"
From MaRDI portal
The following pages link to The computational complexity of the pooling problem (Q5964238):
Displaying 9 items.
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- A polynomially solvable case of the pooling problem (Q513170) (← links)
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- On the effectiveness of sequential linear programming for the pooling problem (Q6103203) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)
- Minimun overlap problem on finite groups (Q6186409) (← links)
