A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access (Q2892140): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / 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: Q4324980 / rank
 
Normal rank

Latest revision as of 08:18, 5 July 2024

scientific article
Language Label Description Also known as
English
A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
scientific article

    Statements

    A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    binary quadratically constrained quadratic programming
    0 references
    semidefinite programming
    0 references
    resource allocation
    0 references
    orthogonal frequency division multiple access
    0 references

    Identifiers