Relaxations and discretizations for the pooling problem (Q513173): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-016-0434-4 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2344092458 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2344092458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / 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 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 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 symmetrical linear maxmin approach to disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive Linear Programming at Exxon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer nonlinear optimization / 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: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New multi-commodity flow formulations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave extensions for nonlinear 0-1 maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities for the Pooling Problem with Binary Variables / 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: 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: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polytope for a Product of Real Linear Functions in 0/1 Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of superincreasing knapsacks and lexicographic orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Bilinear Problems Using MILP Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving planning and design problems in the process industry using mixed integer and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition strategy for the stochastic pooling problem / 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: Some results on the strength of relaxations of multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutting stock problem and integer rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex envelope formula for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale standard pooling problems with constrained pools and fixed demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and sum decomposition of vertex polyhedral convex envelopes / 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: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-016-0434-4 / rank
 
Normal rank

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
Relaxations and discretizations for the pooling problem
scientific article

    Statements

    Relaxations and discretizations for the pooling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    pooling problem
    0 references
    bilinear program
    0 references
    convexification
    0 references
    Lagrange relaxation
    0 references
    discretization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers