Complexity analysis and algorithm design of pooling problem
DOI10.1007/S40305-018-0193-7zbMATH Open1413.90317OpenAlexW2789308580MaRDI QIDQ1660293FDOQ1660293
Authors: Yuhong Dai, Rui Diao, Kai Fu
Publication date: 15 August 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0193-7
Recommendations
Linear programming (90C05) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global minimization by reducing the duality gap
- Strong formulations for the pooling problem
- Pooling problem: alternate formulations and solution methods
- Successive Linear Programming at Exxon
- A bilinear approach to the pooling problem†
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Valid Inequalities for the Pooling Problem with Binary Variables
- An Improved Successive Linear Programming Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- Asymptotics of pooling design performance
- Pooling problems with polynomial-time algorithms
- A polynomially solvable case of the pooling problem
- The computational complexity of the pooling problem
- Applications of the accelerated gradient algorithm for pooling problem
- On the effectiveness of sequential linear programming for the pooling problem
- An optimized approach of venous thrombus embolism risk assessment
- Pooling problem: alternate formulations and solution methods
- Analysis of MILP techniques for the pooling problem
- Analyzing the Pooling Problem
- A cost minimization heuristic for the pooling problem
- Feasibility and cost minimisation for a lithium extraction problem
- A second-order cone programming algorithm for pooling problem
- Strong formulations for the pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Large-scale standard pooling problems with constrained pools and fixed demands
Uses Software
This page was built for publication: Complexity analysis and algorithm design of pooling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660293)