On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705): Difference between revisions

From MaRDI portal
Added link to MaRDI 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/s10107-005-0692-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121785204 / 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: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of Space / 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: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally Robust Controllers for Multivariable Systems / 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: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vector Partition Problem for Convex Objective Functions / 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: Minimum rank and minimum trace of covariance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems on the set of nonnegative definite matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of the greatest lower bound to the reliability and constrained minimum trace factor analysis / 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: Improved approximations for max set splitting and max NAE SAT / rank
 
Normal rank

Latest revision as of 16:56, 24 June 2024

scientific article
Language Label Description Also known as
English
On the gap between the quadratic integer programming problem and its semidefinite relaxation
scientific article

    Statements

    On the gap between the quadratic integer programming problem and its semidefinite relaxation (English)
    0 references
    0 references
    14 June 2006
    0 references
    0 references
    Quadratic integer programming
    0 references
    Semidefinite relaxation
    0 references
    Linear matrix inequalities
    0 references
    Zonotopes
    0 references
    Hyperplane arrangements
    0 references
    0 references