Výsledky vyhledávání - "shortest-path algorithms"

  1. 1

    Optimal ship navigation with safety distance and realistic turn constraints Autor Ari, Ibrahim, Aksakalli, Vural, Aydogˇdu, Volkan, Kum, Serdar

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 16.09.2013
    “… We consider the optimal ship navigation problem wherein the goal is to find the shortest path between two given coordinates in the presence of obstacles subject to safety distance and turn-radius constraints…”
    Získat plný text
    Journal Article
  2. 2

    An outer approximation algorithm for the robust shortest path problem Autor Shahabi, Mehrdad, Unnikrishnan, Avinash, Boyles, Stephen D.

    ISSN: 1366-5545, 1878-5794
    Vydáno: Exeter Elsevier India Pvt Ltd 01.11.2013
    “… We allow correlation between link costs, subject to a regularity condition excluding unbounded solutions…”
    Získat plný text
    Journal Article
  3. 3

    Minimum cost path problems with relays Autor Laporte, Gilbert, Pascoal, Marta M.B.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydáno: Kidlington Elsevier Ltd 2011
    “…The minimum cost path problem with relays (MCPPR) consists of finding a minimum cost path from a source to a destination, along which relay nodes are located at a certain cost, subject to a weight constraint…”
    Získat plný text
    Journal Article
  4. 4

    A Centrality Entropy Maximization Problem in Shortest Path Routing Networks Autor Chellappan, Vanniyarajan, Sivalingam, Krishna M., Krithivasan, Kamala

    ISSN: 1389-1286, 1872-7069
    Vydáno: Amsterdam Elsevier B.V 20.07.2016
    “… We then obtain a centrality distribution that is as broadly distributed as possible subject to the topology constraints…”
    Získat plný text
    Journal Article
  5. 5

    Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios Autor Huang, Zhouchun, Zheng, Qipeng P., Pasiliao, Eduardo L., Simmons, Daniel

    ISSN: 0254-5330, 1572-9338
    Vydáno: New York Springer US 01.02.2017
    Vydáno v Annals of operations research (01.02.2017)
    “…Network routing problems are often modeled with the assumption that the network structure is deterministic, though they are often subject to uncertainty in many real-life scenarios…”
    Získat plný text
    Journal Article
  6. 6

    Technology adoption and training practices as a constrained shortest path problem Autor Formaneck, Steven D., Cozzarin, Brian P.

    ISSN: 0305-0483, 1873-5274
    Vydáno: Oxford Elsevier Ltd 01.04.2013
    Vydáno v Omega (Oxford) (01.04.2013)
    “…Technology adoption is not a new venue for research. Much work of decision modeling, diffusion of new technology and statistical analysis of survey data has…”
    Získat plný text
    Journal Article
  7. 7

    Corridor location: the multi-gateway shortest path model Autor Scaparra, Maria P., Church, Richard L., Medrano, F. Antonio

    ISSN: 1435-5930, 1435-5949
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2014
    Vydáno v Journal of geographical systems (01.07.2014)
    “… Since most systems are subject to environmental review, it is important to generate competitive, but different alternatives…”
    Získat plný text
    Journal Article
  8. 8

    Incorporating transfer reliability into equilibrium analysis of railway passenger flow Autor Shi, Feng, Zhou, Zhao, Yao, Jia, Huang, Helai

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 16.07.2012
    “… In particular, a path-based traffic assignment algorithm which combines a k-shortest path algorithm and the method…”
    Získat plný text
    Journal Article
  9. 9

    Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price Autor Zhu, Xiaoyan, Wilhelm, Wilbert E.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydáno: Kidlington Elsevier Ltd 01.01.2013
    Vydáno v Computers & operations research (01.01.2013)
    “… Often, only a few arc costs are updated at an iteration. Second, RCSP must be solved subject to arcs that are forbidden or prescribed as corresponding binary variables are fixed to 0 or 1 by the branching rule…”
    Získat plný text
    Journal Article
  10. 10

    A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time Autor Quirin, A., Cordón, O., Santamaría, J., Vargas-Quesada, B., Moya-Anegón, F.

    ISSN: 0306-4573, 1873-5371
    Vydáno: Kidlington Elsevier Ltd 01.07.2008
    Vydáno v Information processing & management (01.07.2008)
    “…In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined…”
    Získat plný text
    Journal Article
  11. 11

    A multi-round generalization of the traveling tournament problem and its application to Japanese baseball Autor Hoshino, Richard, Kawarabayashi, Ken-ichi

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 01.12.2011
    “…► We determine the distance-optimal schedule for a pro baseball league in Japan. ► We do this by generalizing the traveling tournament problem to multiple…”
    Získat plný text
    Journal Article
  12. 12

    Fluid Limits for Shortest Remaining Processing Time Queues Autor Down, Douglas G, Gromoll, H. Christian, Puha, Amber L

    ISSN: 0364-765X, 1526-5471
    Vydáno: Linthicum INFORMS 01.11.2009
    Vydáno v Mathematics of operations research (01.11.2009)
    “…We consider a single-server queue with renewal arrivals and i.i.d. service times in which the server uses the shortest remaining processing time policy. To…”
    Získat plný text
    Journal Article
  13. 13

    Short-term Speed Prediction Models for Time Dependent Shortest Path Algorithms in Car Navigation Systems Autor Lee, Seungjae, Lee, Young-Ihn

    ISSN: 1226-5934, 2161-6779
    Vydáno: Taylor & Francis Group 01.10.2004
    “…The objective of this study is the development of the short-term prediction models to predict average spot speeds of the subject location in the short-term periods of 5, 10 and 15 minutes respectively…”
    Získat plný text
    Journal Article
  14. 14

    Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time Autor Ahuja, Ravindra K., Hochbaum, Dorit S.

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum, MD Institute for Operations Research and the Management Sciences 01.01.2008
    Vydáno v Operations research (01.01.2008)
    “… We show how the well-known successive shortest-path algorithm for the minimum-cost flow problem can be used to solve these problems in O(n²…”
    Získat plný text
    Journal Article
  15. 15

    A Note on Parametric Analysis in Linear Assignment Autor Volgenant, A.

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum, MD Institute for Operations Research and the Management Sciences 01.03.2008
    Vydáno v Operations research (01.03.2008)
    “…A classic application of the linear assignment problem is the assignment of people to jobs (or jobs to people). In this context, it is interesting to measure…”
    Získat plný text
    Journal Article
  16. 16

    Mathematical programming in the engineering education Autor Ambrus-Somogyi, K.

    ISBN: 1467347515, 9781467347518
    ISSN: 1949-047X
    Vydáno: IEEE 01.09.2012
    “… The name of the subject is Mathematical Programming. At our university all student must learn one course in a foreign language, in English or in German…”
    Získat plný text
    Konferenční příspěvek
  17. 17

    Shortest path algorithm for graphs in instances of semantic optimization Autor Yu Lavlinskaya, O, Kurchenkova, T V, Kuripta, O V

    ISSN: 1742-6588, 1742-6596
    Vydáno: Bristol IOP Publishing 01.03.2020
    Vydáno v Journal of physics. Conference series (01.03.2020)
    “…This article discusses an example of using the algorithm for finding the shortest path to determine the strength of the connection between different words and phrases of the subject area in the tasks…”
    Získat plný text
    Journal Article
  18. 18

    Investigation of the roles of trace elements during hepatitis C virus infection using protein-protein interactions and a shortest path algorithm Autor Zhu, LiuCun, Chen, XiJia, Kong, Xiangyin, Cai, Yu-Dong

    ISSN: 0304-4165, 0006-3002, 1872-8006
    Vydáno: Netherlands Elsevier B.V 01.11.2016
    Vydáno v Biochimica et biophysica acta (01.11.2016)
    “…Hepatitis is a type of infectious disease that induces inflammation of the liver without pinpointing a particular pathogen or pathogenesis. Type C hepatitis,…”
    Získat plný text
    Journal Article
  19. 19

    Mining for genes related to choroidal neovascularization based on the shortest path algorithm and protein interaction information Autor Zhang, Jian, Suo, Yan, Zhang, Yu-Hang, Zhang, Qing, Chen, XiJia, Xu, Xun, Lu, WenCong

    ISSN: 0304-4165, 0006-3002, 1872-8006
    Vydáno: Netherlands Elsevier B.V 01.11.2016
    Vydáno v Biochimica et biophysica acta (01.11.2016)
    “…Background: Choroidal neovascularization (CNV) is a serious eye disease that may cause visual loss, especially for older people. Many factors have been proven…”
    Získat plný text
    Journal Article
  20. 20

    Lecturers' and Students’ Perception on Learning Dijkstra’s Shortest Path Algorithm Through Mobile Devices Autor Seraj, Mazyar, Wong, Chui Yin

    ISSN: 1865-7923, 1865-7923
    Vydáno: 08.06.2014
    “…) to explore lecturer and student perceptions about learning the subject through mobile devices…”
    Získat plný text
    Journal Article