Pooling Problem: Alternate Formulations and Solution Methods
From MaRDI portal
Publication:3114904
DOI10.1287/mnsc.1030.0207zbMath1232.90349OpenAlexW2106590231WikidataQ58201085 ScholiaQ58201085MaRDI QIDQ3114904
Pierre Hansen, Nenad Mladenović, Charles Audet, Jack Brimberg, Sébastien Le Digabel
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://bura.brunel.ac.uk/handle/2438/6679
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Integrated planning for design and production in two-stage recycling operations, A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints, Pooling problems with polynomial-time algorithms, Analysis of MILP Techniques for the Pooling Problem, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Large-scale standard pooling problems with constrained pools and fixed demands, A multi-commodity flow formulation for the generalized pooling problem, Strong formulations for the pooling problem, Complexity analysis and algorithm design of pooling problem, Tightening methods based on nontrivial bounds on bilinear terms, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Decomposition strategy for the stochastic pooling problem, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, A linear programming approach to difference-of-convex piecewise linear approximation, Strong Convex Nonlinear Relaxations of the Pooling Problem, Variable neighborhood search: basics and variants, Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments, General variable neighborhood search for the continuous optimization, Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search, A cost minimization heuristic for the pooling problem, Global solution of non-convex quadratically constrained quadratic programs, A polynomially solvable case of the pooling problem, Relaxations and discretizations for the pooling problem, New multi-commodity flow formulations for the pooling problem, Double-row facility layout with replicate machines and split flows, Cyclic seesaw process for optimization and identification, Variable neighbourhood search: methods and applications, A branch-and-cut algorithm for mixed-integer bilinear programming, The computational complexity of the pooling problem, Feasibility and cost minimisation for a lithium extraction problem, Reformulations in Mathematical Programming: Definitions and Systematics, Variable neighbourhood search: Methods and applications, A new Lagrangean approach to the pooling problem, Exact and heuristic solutions of the global supply chain problem with transfer pricing, Joint optimization of pricing and planning decisions in divergent supply chain, Optimization and sustainable development
Uses Software
