DC programming in communication systems: challenging problems and methods
Open Access
- 28 November 2013
- journal article
- Published by Springer Nature in Vietnam Journal of Computer Science
- Vol. 1 (1) , 15-28
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Solving Partitioning-Hub Location-Routing Problem using DCAJournal of Industrial and Management Optimization, 2012
- Exact penalty and error bounds in DC programmingJournal of Global Optimization, 2011
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCAJournal of Combinatorial Optimization, 2011
- A combinatorial algorithm for the TDMA message scheduling problemComputational Optimization and Applications, 2007
- Link Scheduling With Power Control for Throughput Enhancement in Multihop Wireless NetworksIEEE Transactions on Vehicular Technology, 2006
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- Geometric Programming for Communication SystemsFoundations and Trends® in Communications and Information Theory, 2005
- Utility-based rate control in the Internet for elastic trafficIEEE/ACM Transactions on Networking, 2002
- A D.C. Optimization Algorithm for Solving the Trust-Region SubproblemSIAM Journal on Optimization, 1998
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998