A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks
From MaRDI portal
Publication:1652272
DOI10.1016/j.cor.2017.01.011zbMath1391.90157OpenAlexW2582996858MaRDI QIDQ1652272
Pham Thi Hoai, Nguyen Canh Nam
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.011
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Boolean programming (90C09)
Cites Work
- Unnamed Item
- Exact penalty and error bounds in DC programming
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- 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
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- A continuous DC programming approach to the strategic supply chain design problem from qualified partner set
- A continuous approch for globally solving linearly constrained quadratic
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
This page was built for publication: A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks
