A multi-commodity flow formulation for the generalized pooling problem
From MaRDI portal
Publication:2392115
Recommendations
- New multi-commodity flow formulations for the pooling problem
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- Pooling problem: alternate formulations and solution methods
- Strong formulations for the pooling problem
- Pooling problems with polynomial-time algorithms
Cites work
- A bilinear approach to the pooling problem†
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- BARON: A general purpose global optimization software package
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- Global minimization by reducing the duality gap
- scientific article; zbMATH DE number 1857670 (Why is no real title available?)
- scientific article; zbMATH DE number 757683 (Why is no real title available?)
- Introduction to global optimization.
- Jointly Constrained Biconvex Programming
- Pooling problem: alternate formulations and solution methods
- Strong formulations for the pooling problem
Cited in
(16)- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- QPLIB: a library of quadratic programming instances
- Strong formulations for the pooling problem
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- Pooling problems with polynomial-time algorithms
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A cost minimization heuristic for the pooling problem
- Strong convex nonlinear relaxations of the pooling problem
- A polynomially solvable case of the pooling problem
- Relaxations and discretizations for the pooling problem
- New multi-commodity flow formulations for the pooling problem
- The computational complexity of the pooling problem
- Improved rank-one-based relaxations and bound tightening techniques for the pooling problem
This page was built for publication: A multi-commodity flow formulation for the generalized pooling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392115)
