Weighted Sum-Rate Maximization for a Set of Interfering Links via Branch and Bound

DOI10.1109/TSP.2011.2152397MaRDI QIDQ4573140zbMATH OpenFDO

Authors Pradeep Chathuranga Weeraddana, Marian Codreanu, Matti Latva-aho, Anthony Ephremides

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2011.2152397

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication theory (94A05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(2)

• Efficient Solutions for Weighted Sum Rate Maximization in Multicellular Networks With Channel Uncertainties
• Decentralized Sum Rate Maximization With QoS Constraints for Interfering Broadcast Channel Via Successive Convex Approximation

This page was built for publication: Weighted Sum-Rate Maximization for a Set of Interfering Links via Branch and Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573140)