Pages that link to "Item:Q2392127"
From MaRDI portal
The following pages link to Strong formulations for the pooling problem (Q2392127):
Displayed 25 items.
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- 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)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← 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)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (Q2294075) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
- Analysis of MILP Techniques for the Pooling Problem (Q3453340) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)
- A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)