New multi-commodity flow formulations for the pooling problem (Q524906): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57955291, #quickstatements; #temporary_batch_1710276387428
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-016-0404-x / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-016-0404-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2306380836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly constrained bilinear programs and related problems: An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Optimization by Successive Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-commodity flow formulation for the generalized pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cost minimization heuristic for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangean approach to the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pooling Problem: Alternate Formulations and Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive Linear Programming at Exxon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization by reducing the duality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of MILP Techniques for the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-relaxed dual global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear approach to the pooling problem† / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modeling Language for Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations and discretizations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Successive Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of bilinear programs with a multiparametric disaggregation technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parametric disaggregation technique for global optimization of polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Linear Programming Formulation Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental and encoding formulations for mixed integer programming / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jgo/BolandKR16 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-016-0404-X / rank
 
Normal rank

Latest revision as of 20:27, 9 December 2024

scientific article
Language Label Description Also known as
English
New multi-commodity flow formulations for the pooling problem
scientific article

    Statements

    New multi-commodity flow formulations for the pooling problem (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2017
    0 references
    pooling problem
    0 references
    bilinear programming
    0 references
    nonlinear programming
    0 references
    linear relaxation
    0 references
    global optimization
    0 references
    blending
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers