Pages that link to "Item:Q1660293"
From MaRDI portal
The following pages link to Complexity analysis and algorithm design of pooling problem (Q1660293):
Displaying 14 items.
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- A cost minimization heuristic for the pooling problem (Q490199) (← links)
- A polynomially solvable case of the pooling problem (Q513170) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- An optimized approach of venous thrombus embolism risk assessment (Q2060076) (← links)
- Feasibility and cost minimisation for a lithium extraction problem (Q2289901) (← links)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Pooling Problem: Alternate Formulations and Solution Methods (Q3114904) (← links)
- Analysis of MILP Techniques for the Pooling Problem (Q3453340) (← links)
- Analyzing the Pooling Problem (Q4896448) (← links)
- Asymptotics of pooling design performance (Q4954228) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)
- On the effectiveness of sequential linear programming for the pooling problem (Q6103203) (← links)