%0 Journal Article
%T Research on the Optimization Problems in Network Coding<br>网络编码中的优化问题研究
%A HUANG Zheng
%A WANG Xin
%A <br>黄政
%A 王新
%J 软件学报
%D 2009
%I 
%X This paper briefly reviews the theoretical researches on network coding, from which the significance of research on optimization problems is revealed. Based on the network information flow model, it makes a survey on the formulation, characteristics and algorithms of optimization problems with the latest results. According to the goal of optimization, the typical optimization problems in network coding are classified into four categories: minimum-cost multicast, throughput maximization in undirected networks, minimum number of coding nodes and links, topology design of network coding-based multicast networks. The general approaches to deal with these problems are categorized. For (linear or convex) programming problems, the solutions are summarized; for NP complete problems, the latest heuristic algorithms and their difficulties are analyzed. The perspectives on future work are also discussed.
%K network coding
%K wireless network coding
%K optimization
%K linear programming
%K convex programming
%K NP complete problem
%K genetic algorithm<br>网络编码
%K 无线网络编码
%K 优化
%K 线性规划
%K 凸规划
%K NP完全问题
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C5D86E55388C6F75A609EA46D8B5ADA8&yid=DE12191FBD62783C&vid=A04140E723CB732E&iid=94C357A881DFC066&sid=9C959CAF55D6B1C2&eid=700C99D38A660C7C&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=41