反瓶颈Steiner树问题研究.pdfVIP

沈阳师范大学 硕士学位论文 反瓶颈Steiner树问题 姓名：吴爽 申请学位级别：硕士 专业：管理科学与工程 指导教师：唐恒永 Steiner Steiner Steiner Steiner Steiner ℄ ÆSteiner Steiner Steiner Æ Æ Steiner Steiner Steiner Steiner l1 Steiner l1 Steiner l∞ Steiner l∞ Steiner Hamming Steiner Hamming Steiner Steiner l1 l∞ Hamming Steiner Steiner l1 l∞ Hamming Inverse Bottleneck Steiner Tree Problem Abstract: This paper main discuss the inverse bottleneck Steiner tree problem, Steiner tree problem is an important section of optimization problems.A series of problems about Steiner tree come from practice of life.Therefore more and more people are concerned about this aera. Steiner tree problem are an important research content in network design , and the problem associated with it at the laying of oil and gas pipelines, electricity cables to set up, communications net- work design and other fields have extensive application. When asked the largest edge of Steiner tree is minimum, and this is the bottleneck Steiner tree problem, it also has a very wide range of applications. Inverse bottleneck Steiner tree problem is that given a feasible solution, mod- ified with the restricted edges to make it a bottleneck Steiner tree problem with the optimal solution, and the modified cost of the edge is minimum with the re- quest norms. If the bottleneck Steiner tree has polynomial-time algorithm, then the inverse bottleneck Steiner tree has polynomial-time algorithm. We study the inverse bottleneck Steiner tree problem with fix value under the l1 norm,extend the given value to the arbitrary value problem under the l1 norm,give its polynomial-time algorithm.We study the invers