Polynomial algorithms to finite Veber problem for a tree network-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Polynomial algorithms to finite Veber problem for a tree network

Published:1991-06 Issue:1-3 Volume:35 Page:291-296
ISSN:0377-0427
Container-title:Journal of Computational and Applied Mathematics
language:en
Short-container-title:Journal of Computational and Applied Mathematics

Author:

Panyukov Anatoly V.,Pelzwerger Boris V.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference6 articles.

1. A note on two problems in connection with graphs;Dijkstra;Numer. Math.,1959

2. Algorithm 97: Shortest path;Floyd;Comm. ACM,1962

3. Facilities Layout and Location: an Analytical Approach;Francis,1974

4. On the one-dimension space allocation problem;Picard;Oper. Res.,1981

5. An effective algorithm to Veber problem with a rectangular metric;Trubin;Kibernetika,1978

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Existence of an Integer Solution to the Relaxed Weber Problem for a Tree Network;Automation and Remote Control;2019-07

2. On the Existence of an Integer Solution of the Relaxed Weber Problem for a Tree Network;Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software";2019

3. Algorithm for the discrete Weber’s problem with an accuracy estimate;Automation and Remote Control;2016-07

4. POLYNOMIAL SOLVABILITY OF NP-COMPLETE PROBLEMS;ScienceOpen Research;2014-12-16

5. Solving a maximin location problem on the plane with given accuracy;Automation and Remote Control;2014-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP