New multi-commodity flow formulations for the pooling problem
From MaRDI portal
Publication:524906
DOI10.1007/S10898-016-0404-XzbMath1369.90132DBLPjournals/jgo/BolandKR16OpenAlexW2306380836WikidataQ57955291 ScholiaQ57955291MaRDI QIDQ524906
Natashia Boland, Fabian Rigterink, Thomas Kalinowski
Publication date: 27 April 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0404-x
global optimizationnonlinear programmingbilinear programmingblendinglinear relaxationpooling problem
Related Items (8)
Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ Tightening methods based on nontrivial bounds on bilinear terms ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Variable Bound Tightening and Valid Constraints for Multiperiod Blending ⋮ Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ A polynomially solvable case of the pooling problem ⋮ Relaxations and discretizations for the pooling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A cost minimization heuristic for the pooling problem
- Relaxations and discretizations for the pooling problem
- Jointly constrained bilinear programs and related problems: An overview
- 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
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Primal-relaxed dual global optimization approach
- Global minimization by reducing the duality gap
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A multi-commodity flow formulation for the generalized pooling problem
- Strong formulations for the pooling problem
- Incremental and encoding formulations for mixed integer programming
- Mixed Integer Linear Programming Formulation Techniques
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Pooling Problem: Alternate Formulations and Solution Methods
- Analysis of MILP Techniques for the Pooling Problem
- Jointly Constrained Biconvex Programming
- An Improved Successive Linear Programming Algorithm
- Successive Linear Programming at Exxon
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A bilinear approach to the pooling problem†
- Nonlinear Optimization by Successive Linear Programming
- Benchmarking optimization software with performance profiles.
This page was built for publication: New multi-commodity flow formulations for the pooling problem
