Pages that link to "Item:Q513170"
From MaRDI portal
The following pages link to A polynomially solvable case of the pooling problem (Q513170):
Displaying 9 items.
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- Complexity analysis and algorithm design of pooling problem (Q1660293) (← 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)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) (← links)
- Analyzing the Pooling Problem (Q4896448) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)
