An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764): Difference between revisions

From MaRDI portal
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: SparsePOP / 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/978-3-642-20807-2_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1576720100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting group symmetry in truss topology optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting special structure in semidefinite programming: a survey of theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry groups, semidefinite programs, and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing underlying sparsity in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming vs. LP Relaxations for Polynomial Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representations for finite varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing polynomials via sum of squares over the gradient ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting equalities in polynomial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the S-Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the quadratic assignment problem using the bundle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class of global minimum bounds of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: LMI Approximations for Cones of Positive Semidefinite Forms / rank
 
Normal rank

Latest revision as of 04:43, 4 July 2024

scientific article
Language Label Description Also known as
English
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
scientific article

    Statements

    An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    binary polynomial programming
    0 references
    binary quadratic programming
    0 references
    valid inequality generation
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers