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


An algorithm for the minimax weber problem
Authors:Søren Kruse Jacobsen
Institution:IMSOR, The Technical University of Denmark, Lyngby, Denmark
Abstract:The paper presents an algorithm for finding the weighted absolute center of a given set of points in the Euclidean plane.The algorithm is a specialized implementation of the method of feasible directions.The presentation includes a proof of convergence as well as computational experience.
Keywords:Location  method of feasible directions
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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