Efficient linear reformulations for binary polynomial optimization problems (Q6164618): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2023.106240 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact quadratizations for pseudo-Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic algorithm for pseudo-Boolean programming revisited / 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: On linear programming relaxations for solving polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multilinear Polytope for Acyclic Hypergraphs / 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: Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unconstrained binary quadratic programming problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal quadratic reformulations of fourth degree pseudo-Boolean functions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2023.106240 / rank
 
Normal rank

Latest revision as of 19:02, 30 December 2024

scientific article; zbMATH DE number 7706742
Language Label Description Also known as
English
Efficient linear reformulations for binary polynomial optimization problems
scientific article; zbMATH DE number 7706742

    Statements

    Efficient linear reformulations for binary polynomial optimization problems (English)
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    polynomial optimization
    0 references
    MINLP
    0 references
    linear reformulation
    0 references

    Identifiers