Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2941668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximization of quadratic form over intersection of ellipsoids with common center / 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: Q3499508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A .699-approximation algorithm for Max-Bisection. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs / rank
 
Normal rank

Revision as of 07:42, 12 July 2024

scientific article
Language Label Description Also known as
English
Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
scientific article

    Statements

    Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (English)
    0 references
    0 references
    0 references
    22 July 2016
    0 references
    nonconvex quadratically constrained quadratic programming
    0 references
    semidefinite program relaxation
    0 references
    approximation bound
    0 references
    NP-hard
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references