Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-017-0577-y / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-017-0577-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2766473453 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59613004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex 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: 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: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / 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: Analyzing the computational impact of MIQCP solver components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending a CIP Framework to Solve MIQCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially solvable case of the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO / 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: Q5306655 / 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: 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: Solving Mixed Integer Bilinear Problems Using MILP Formulations / 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: Pooling problems with polynomial-time algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of the pooling problem / 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: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem / 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: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / 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: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / 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: 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: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-017-0577-Y / rank
 
Normal rank

Latest revision as of 02:07, 11 December 2024

scientific article
Language Label Description Also known as
English
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
scientific article

    Statements

    Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (English)
    0 references
    0 references
    0 references
    29 August 2018
    0 references
    standard pooling problem
    0 references
    global optimization
    0 references
    piecewise structure
    0 references
    sparsity
    0 references
    discretization
    0 references
    \(P/ NP\) boundary
    0 references
    strongly-polynomial algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers