Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
From MaRDI portal
Publication:1668789
DOI10.1007/s10898-017-0577-yzbMath1405.90103OpenAlexW2766473453WikidataQ59613004 ScholiaQ59613004MaRDI QIDQ1668789
Radu Baltean-Lugojan, Ruth Misener
Publication date: 29 August 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0577-y
discretizationglobal optimizationsparsity\(P/ NP\) boundarypiecewise structurestandard pooling problemstrongly-polynomial algorithms
Related Items
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ StdPooling-PolyAlgos
Uses Software
Cites Work
- Unnamed Item
- Pooling problems with polynomial-time algorithms
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A polynomially solvable case of the pooling problem
- Relaxations and discretizations for the pooling problem
- Factoring polynomials with rational coefficients
- 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 numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Analyzing the computational impact of MIQCP solver components
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A multi-commodity flow formulation for the generalized pooling problem
- Strong formulations for the pooling problem
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- Extending a CIP Framework to Solve MIQCPs
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Valid Inequalities for the Pooling Problem with Binary Variables
- Pooling Problem: Alternate Formulations and Solution Methods
- Branching and bounds tighteningtechniques for non-convex MINLP
- Analysis of MILP Techniques for the Pooling Problem
- Jointly Constrained Biconvex Programming
- 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†
- The computational complexity of the pooling problem
