首页 | 本学科首页   官方微博 | 高级检索  
     检索      


An improved algorithm for computing Steiner minimal trees in Euclidean -space
Authors:Marcia Fampa  Kurt M Anstreicher  
Institution:aInstitute of Mathematics, Department of Computer Sciences, Federal University of Rio de Janeiro, CP 68.530, 21941-590 Rio de Janeiro, RJ, Brazil;bDepartment of Management Sciences, University of Iowa, Iowa City, IA 52242, USA
Abstract:
Keywords:Euclidean Steiner problem  Steiner tree  Branch and bound  Strong branching
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号