Strong formulations for the pooling problem (Q2392127): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009015381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / 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: 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: A Decomposition Strategy for Global Optimum Search in the Pooling Problem / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms / 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: Nonlinear Optimization by Successive Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple SLP algorithm for solving a class of nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for global minimization of separable concave programs / 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: Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Successive Linear Programming Algorithm / rank
 
Normal rank

Latest revision as of 17:30, 6 July 2024

scientific article
Language Label Description Also known as
English
Strong formulations for the pooling problem
scientific article

    Statements

    Strong formulations for the pooling problem (English)
    0 references
    0 references
    0 references
    1 August 2013
    0 references
    0 references
    pooling problem
    0 references
    bilinear programming
    0 references
    global optimization
    0 references
    linear relaxation
    0 references
    computational complexity
    0 references
    0 references
    0 references