New multi-commodity flow formulations for the pooling problem
From MaRDI portal
Recommendations
- A multi-commodity flow formulation for the generalized 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
- Strong convex nonlinear relaxations of the pooling problem
Cites work
- scientific article; zbMATH DE number 1054664 (Why is no real title available?)
- scientific article; zbMATH DE number 1054665 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- A bilinear approach to the pooling problem†
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A cost minimization heuristic for the pooling problem
- A multi-commodity flow formulation for the generalized pooling problem
- A new Lagrangean approach to the pooling problem
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- An Improved Successive Linear Programming Algorithm
- Analysis of MILP techniques for the pooling problem
- Benchmarking optimization software with performance profiles.
- 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
- Global minimization by reducing the duality gap
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Incremental and encoding formulations for mixed integer programming
- Jointly Constrained Biconvex Programming
- Jointly constrained bilinear programs and related problems: An overview
- Mixed integer linear programming formulation techniques
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Nonlinear Optimization by Successive Linear Programming
- Pooling problem: alternate formulations and solution methods
- Primal-relaxed dual global optimization approach
- Relaxations and discretizations for the pooling problem
- Strong formulations for the pooling problem
- Successive Linear Programming at Exxon
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(11)- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- A polynomially solvable case of the pooling problem
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
- Strong convex nonlinear relaxations of the pooling problem
- Tightening methods based on nontrivial bounds on bilinear terms
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- A multi-commodity flow formulation for the generalized pooling problem
- Strong formulations for the pooling problem
- Relaxations and discretizations for the pooling problem
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
This page was built for publication: New multi-commodity flow formulations for the pooling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524906)
