关于Steiner问题的一个注记——连接五点之最小网络的一种寻优方案
관우Steiner문제적일개주기——련접오점지최소망락적일충심우방안
A Note on The Steiner Problem——An Approach to Find The Minimal Network with Five Given Points
  • 万方数据
    运筹学学报 운주학학보
    OR TRANSACTIONS
    2010年 1期 1-14 ,共14页

    越民义%程丛电

    월민의%정총전

    运筹学%最小网络%几何作图%Steiner树 運籌學%最小網絡%幾何作圖%Steiner樹
    운주학%최소망락%궤하작도%Steiner수
    Keywords Operations research%minimal network%Steiner tree for 5 given points%simple construction
    本文讨论如何寻找连接平面上五个给定点的最小网络这一问题.通过发展越民义证明Pollack在1978年所给出的一个关于寻找连接平面上四个给定点的最小网络的重要结论的方法,我们给出了一个采用简单几何作图方法快速求解该问题的方案.
    본문토론여하심조련접평면상오개급정점적최소망락저일문제.통과발전월민의증명Pollack재1978년소급출적일개관우심조련접평면상사개급정점적최소망락적중요결론적방법,아문급출료일개채용간단궤하작도방법쾌속구해해문제적방안.
    This article addresses the problem how to find a minimal network con-necting 5 given points in the plane. The related results with four points have been given by Pollack (1978) and Yue Minyi. The present work proposes a fast algorithm to solve the problem.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문