New multi-commodity flow formulations for the pooling problem
type: Item
instance of: scholarly article
title: New multi-commodity flow formulations for the pooling problem
zbMATH Open document ID: 1369.90132
author: Natashia Boland
author: Thomas Kalinowski
author: Fabian Rigterink
published in: Journal of Global Optimization
publication date: 2017-04-27T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6708399
zbMATH Keywords: pooling problem
zbMATH Keywords: bilinear programming
zbMATH Keywords: nonlinear programming
zbMATH Keywords: linear relaxation
zbMATH Keywords: global optimization
zbMATH Keywords: blending
describes a project that uses: AMPL
describes a project that uses: CPLEX
describes a project that uses: SCIP
describes a project that uses: cGOP
describes a project that uses: GAMS
describes a project that uses: BARON
describes a project that uses: Ipopt
describes a project that uses: APOGEE
describes a project that uses: GloMIQO
MaRDI profile type: Publication
Wikidata QID: Q57955291
full work available at URL: s10898-016-0404-x
OpenAlex ID: W2306380836
cites work: A new reformulation-linearization technique for bilinear programming problems
cites work: Jointly constrained bilinear programs and related problems: An overview
cites work: Jointly Constrained Biconvex Programming
cites work: Q5306655
cites work: Nonlinear Optimization by Successive Linear Programming
cites work: A multi-commodity flow formulation for the generalized pooling problem
cites work: Strong formulations for the pooling problem
cites work: A cost minimization heuristic for the pooling problem
cites work: A new Lagrangean approach to the pooling problem
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Pooling Problem: Alternate Formulations and Solution Methods
cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
cites work: Successive Linear Programming at Exxon
cites work: Global minimization by reducing the duality gap
cites work: Analysis of MILP Techniques for the Pooling Problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Primal-relaxed dual global optimization approach
cites work: A bilinear approach to the pooling problem†
cites work: A Modeling Language for Mathematical Programming
cites work: Relaxations and discretizations for the pooling problem
cites work: An Improved Successive Linear Programming Algorithm
cites work: Global optimization of bilinear programs with a multiparametric disaggregation technique
cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: Multi-parametric disaggregation technique for global optimization of polynomial programming problems
cites work: Mixed integer linear programming formulation techniques
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
cites work: Q4352205
cites work: Q4352204
cites work: Incremental and encoding formulations for mixed integer programming
DBLP publication ID: journals/jgo/BolandKR16
DOI: 10.1007/S10898-016-0404-X
description: scientific article; zbMATH DE number 6708399