On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex problems with multilinear intermediates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality constrained multilinear sets / 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: A class of valid inequalities for multilinear 0-1 optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Study of Binary Polynomial Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multilinear Polytope for Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposability of multilinear sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Running Intersection Relaxation of the Multilinear Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of running intersection inequalities for globally solving polynomial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid LP/NLP paradigm for global optimization relaxations / 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: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of bounds for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / 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: Explicit convex and concave envelopes through polyhedral subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank

Latest revision as of 12:29, 1 August 2024

scientific article; zbMATH DE number 7703348
Language Label Description Also known as
English
On the strength of recursive McCormick relaxations for binary polynomial optimization
scientific article; zbMATH DE number 7703348

    Statements

    On the strength of recursive McCormick relaxations for binary polynomial optimization (English)
    0 references
    0 references
    28 June 2023
    0 references
    binary polynomial optimization
    0 references
    recursive McCormick relaxations
    0 references
    multilinear polytope
    0 references
    extended flower relaxation
    0 references
    cutting planes
    0 references

    Identifiers