Pages that link to "Item:Q306403"
From MaRDI portal
The following pages link to Pooling problems with polynomial-time algorithms (Q306403):
Displaying 10 items.
- A polynomially solvable case of the pooling problem (Q513170) (← 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)
- A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
- Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) (← links)
- Some results on pooling (Q3792061) (← links)
- (Q4721888) (← links)
- Analyzing the Pooling Problem (Q4896448) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)