Pooling problem: alternate formulations and solution methods
From MaRDI portal
Recommendations
- A bilinear approach to the pooling problem†
- Complexity analysis and algorithm design of pooling problem
- scientific article; zbMATH DE number 1795200
- Large-scale standard pooling problems with constrained pools and fixed demands
- On the effectiveness of sequential linear programming for the pooling problem
Cited in
(58)- 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
- Integrated planning for design and production in two-stage recycling operations
- Complexity analysis and algorithm design of pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Variable neighborhood search: basics and variants
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
- Cyclic seesaw process for optimization and identification
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Decomposition strategy for the stochastic pooling problem
- Double-row facility layout with replicate machines and split flows
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- Tightening methods based on nontrivial bounds on bilinear terms
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Feasibility and cost minimisation for a lithium extraction problem
- Optimization and sustainable development
- 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
- Joint optimization of pricing and planning decisions in divergent supply chain
- Comparison of discrete and continuous models for the pooling problem
- A decomposition-based heuristic for collaborative scheduling in a network of open-pit mines
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- Pooling problems with polynomial-time algorithms
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Analysis of MILP techniques for the pooling problem
- Reformulations in Mathematical Programming: Definitions and Systematics
- GLOMIQO: global mixed-integer quadratic optimizer
- Some results on pooling
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- A bilinear approach to the pooling problem†
- Modelling the pooling problem at the New Zealand Refining Company
- scientific article; zbMATH DE number 1795200 (Why is no real title available?)
- Global solution of non-convex quadratically constrained quadratic programs
- scientific article; zbMATH DE number 3993338 (Why is no real title available?)
- Analyzing the Pooling Problem
- A cost minimization heuristic for the pooling problem
- Applications of the accelerated gradient algorithm for pooling problem
- Strong convex nonlinear relaxations of the pooling problem
- A polynomially solvable case of the pooling problem
- Relaxations and discretizations for the pooling problem
- A second-order cone programming algorithm for pooling problem
- New multi-commodity flow formulations for the pooling problem
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- The computational complexity of the pooling problem
- A linear programming approach to difference-of-convex piecewise linear approximation
- On the effectiveness of sequential linear programming for the pooling problem
- A strong P-formulation for global optimization of industrial water-using and treatment networks
- A new model and algorithm design of pooling problem
- Improved rank-one-based relaxations and bound tightening techniques for the pooling problem
- Scheduling cool jobs when processing heats them
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- General variable neighborhood search for the continuous optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Variable neighbourhood search: methods and applications
This page was built for publication: Pooling problem: alternate formulations and solution methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114904)
