DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks

DOI10.1007/978-3-319-17996-4_5zbMath1351.90133OpenAlexW1182568510MaRDI QIDQ2808070

Pham Thi Hoai, Nam Nguyen Canh, Tran van Huy

Publication date: 26 May 2016

Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17996-4_5

zbMATH Keywords

DCAbranch-and-boundDC programmingWiMAXpure 0-1 programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Boolean programming (90C09) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

DC programming and DCA: thirty years of developments

Cites Work

• Exact penalty and error bounds in DC programming
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

This page was built for publication: DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks