Pages that link to "Item:Q2392115"
From MaRDI portal
The following pages link to A multi-commodity flow formulation for the generalized pooling problem (Q2392115):
Displaying 15 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)
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← 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)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)
