Analysis of MILP techniques for the pooling problem
From MaRDI portal
Publication:3453340
Recommendations
Cites work
- A cost minimization heuristic for the pooling problem
- Benchmarking optimization software with performance profiles.
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Comparison of discrete and continuous models for the pooling problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Global minimization by reducing the duality gap
- Pooling problem: alternate formulations and solution methods
- Relaxations and discretizations for the pooling problem
- Strong formulations for the pooling problem
- Successive Linear Programming at Exxon
- Valid Inequalities for the Pooling Problem with Binary Variables
Cited in
(28)- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- The convex hull of a quadratic constraint over a polytope
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- Pooling problems with polynomial-time algorithms
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- A polynomially solvable case of the pooling problem
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
- The computational complexity of the pooling problem
- A new Lagrangean approach to the pooling problem
- On the effectiveness of sequential linear programming for the pooling problem
- Strong convex nonlinear relaxations of the pooling problem
- Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Tightening methods based on nontrivial bounds on bilinear terms
- Solving certain complementarity problems in power markets via convex programming
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Analyzing the Pooling Problem
- Error bounds for monomial convexification in polynomial optimization
- Compact mixed-integer programming formulations in quadratic optimization
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
- Relaxations and discretizations for the pooling problem
- New multi-commodity flow formulations for the pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- Extended formulations for convex hulls of some bilinear functions
This page was built for publication: Analysis of MILP techniques for the pooling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453340)
