:::

詳目顯示

回上一頁
題名:網路系統中解單一中心場站位置方法之研究
書刊名:運輸計劃
作者:蔡輝昇
出版日期:1986
卷期:15:2
頁次:頁207-219
主題關鍵詞:中心場站方法位置系統單一網路
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(7) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:7
  • 共同引用共同引用:0
  • 點閱點閱:23
期刊論文
1.Dijkstra, E. W.(1959)。A Note on Two Problems in Connection with Graphs。Numerishe Mathematik,1,269-271。  new window
2.Hakimi, S. L.(1964)。Optimum Locations of Switching Centers and the Absolute Centers and Medians of A Graph。Operations Research,12(3),450-459。  new window
3.Floyd, R. W.(1962)。Algorithm 97, Shortest Path。Communications of the ACM,5(6),345。  new window
4.Hakimi, S. L.(1965)。Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems。Operation Research,13,462-475。  new window
5.Handler, G. Y.(1984)。The Absolute m-Center Problem on a Directed Network。Transportation Science,18(3),300-303。  new window
6.Tansel, Barbaros C.、Francis, R. L.、Lowe, T. J.(1983)。Location on Networks: A Survey. Part I: The p-Center and p-Median Problems。Management Science,29(4),482-497。  new window
7.Tansel, Barbaros C.、Francis, R. L.、Lowe, T. J.(1983)。Location on Networks: A Survey Parx II: Exploiting Tree Network Structure。Management Science,29(4),498-511。  new window
8.Minieka, E.(1981)。A Polynomial Time Algorithm for Finding the Absolute Center of A Network。Networks,11,351-355。  new window
會議論文
1.Fricker, J. D.、Tsay, H. S.(1985)。A Polynomial Time Algorithm to Solve General Absolute Center。ORSA/TIMS Joint National Meeting。Atlanta。  new window
研究報告
1.Glover, F.、Glover, R.、Klingman, D.(1981)。Computational Study of An Improved Shortest Path Algorithm。University of Texas。  new window
學位論文
1.Tsay, H. S.(1985)。The Combined Facility Location and Vchicle Routing Problem: Formulation and Solution(博士論文)。Purdue University。  new window
圖書
1.Larson, R. C.、Odoni, A. R.(1981)。Urban Operations Research。New Jersey:Prentice-Hall。  new window
2.Christofides, N.(1975)。Graph theory an algorithmic approach。Academic Press。  new window
3.Gurevich, Y.、Stockmeyer, L.、Vishki, U.(19820420)。Solving NP-Hard Problems on Graphs that are Almost Trees and An Application to Facility Location Problems。IBM Thomas J. Watson Research Center。  new window
4.Handler, G. Y.、Mirchandani, P. B.(1979)。Location on Networks Theory and Algorithms。The MIT Press。  new window
5.Phillips, D. T.、Garcia-Diaz, A.(1981)。Fundmentals of Network Analysis。Prentice-Hall。  new window
6.Wong, R. T.(1983)。Recent Research on Location and Network Design Problems: An Annotated Bibliography。Krannert Graduate School of Management, Purdue University。  new window
7.Hu, Te Chiang(1969)。Integer Programming and Network Flows。Addison-Wesley Publishing Co.。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top