Pages that link to "Item:Q524906"

The following pages link to New multi-commodity flow formulations for the pooling problem (Q524906):

Displaying 11 items.

• A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
• A polynomially solvable case of the pooling problem (Q513170) (← links)
• Relaxations and discretizations for the pooling problem (Q513173) (← 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)
• A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
• Strong formulations for the pooling problem (Q2392127) (← links)
• Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
• Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
• Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)