A cost minimization heuristic for the pooling problem

DOI10.1007/S10479-013-1433-1zbMATH Open1303.90110OpenAlexW2045170129MaRDI QIDQ490199FDOQ490199

Authors: Mohammed Alfaki, Dag Haugland 

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1433-1

Recommendations

• Pooling problem: alternate formulations and solution methods
• Complexity analysis and algorithm design of pooling problem
• The computational complexity of the pooling problem
• Analyzing the Pooling Problem
• A multi-commodity flow formulation for the generalized pooling problem

zbMATH Keywords

network optimizationpooling problemheuristic methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Cites Work

• A polyhedral branch-and-cut approach to global optimization
• 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
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A new Lagrangean approach to the pooling problem
• Global minimization by reducing the duality gap
• A multi-commodity flow formulation for the generalized pooling problem
• 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†
• Optimization Models for the Natural Gas Value Chain
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
• A nonlinear programming technique for the optimization of continuous processing systems
• A Decomposition Strategy for Global Optimum Search in the Pooling Problem
• Modelling the pooling problem at the New Zealand Refining Company
• An Improved Successive Linear Programming Algorithm
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• Nonlinear Optimization by Successive Linear Programming
• A simple SLP algorithm for solving a class of nonlinear programs
• Comparison of discrete and continuous models for the pooling problem

Cited In (6)

• A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
• The computational complexity of the pooling problem
• Analysis of MILP techniques for the pooling problem
• Feasibility and cost minimisation for a lithium extraction problem
• Relaxations and discretizations for the pooling problem
• New multi-commodity flow formulations for the pooling problem

Uses Software

• SINTEF

This page was built for publication: A cost minimization heuristic for the pooling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490199)