Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-014-0164-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056735991 / rank
 
Normal rank
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: Partition of Space / 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: A Decomposition Method for Quadratic Zero-One 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: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: New bounds on the unconstrained quadratic integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound and approximation algorithm for binary constrained quadratic programming problem / 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: An Implicit Enumeration Algorithm for Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic assignment formulation of the molecular conformation problem / 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: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality gap in binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New semidefinite programming relaxations for box constrained quadratic program / 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

Latest revision as of 21:01, 9 July 2024

scientific article
Language Label Description Also known as
English
Parametric Lagrangian dual for the binary quadratic programming problem
scientific article

    Statements

    Parametric Lagrangian dual for the binary quadratic programming problem (English)
    0 references
    0 references
    0 references
    24 March 2015
    0 references
    binary quadratic program
    0 references
    semidefinite programming
    0 references
    lower bound
    0 references
    Lagrangian dual
    0 references
    D.C. decomposition
    0 references
    0 references
    0 references
    0 references

    Identifiers