A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access

DOI10.1002/net.20475zbMath1242.90150OpenAlexW1991108470MaRDI QIDQ2892140

Ismael Soto, Abdel Lisser, Pablo Adasme

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20475

zbMATH Keywords

semidefinite programmingresource allocationorthogonal frequency division multiple accessbinary quadratically constrained quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (1)

Stochastic nuclear outages semidefinite relaxations

Uses Software

• CSDP

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Some simplified NP-complete graph problems
• A semidefinite programming approach to the quadratic knapsack problem
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• CSDP, A C library for semidefinite programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

This page was built for publication: A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access