On duality gap in binary quadratic programming (Q454277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A polynomial case of unconstrained zero-one quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral bounds for the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable class of quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of a dual weak vector variational inequality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound improvement and forcing rule for quadratic binary programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially Solvable Cases of Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of test problems in quadratic bivalent programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in semidefinite and interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches to hard discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations of (0, 1)-Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / 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: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming / rank
 
Normal rank

Latest revision as of 18:23, 5 July 2024

scientific article
Language Label Description Also known as
English
On duality gap in binary quadratic programming
scientific article

    Statements

    On duality gap in binary quadratic programming (English)
    0 references
    0 references
    0 references
    1 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    binary quadratic programming
    0 references
    duality gap
    0 references
    semidefinite programming relaxation
    0 references
    cell enumeration of hyperplane arrangement
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references