Neuhäuser, David; Hirsch, Christian; Gloaguen, Catherine; Schmidt, Volker Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations. (English) Zbl 1453.60016 J. Stat. Comput. Simulation 84, No. 7, 1486-1504 (2014). MSC: 60D05 60-08 PDFBibTeX XMLCite \textit{D. Neuhäuser} et al., J. Stat. Comput. Simulation 84, No. 7, 1486--1504 (2014; Zbl 1453.60016) Full Text: DOI
Liu, Linzhong; Yang, Juhua; Mu, Haibo; Li, Xiaojing; Wu, Fang Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network. (English) Zbl 1427.90283 Appl. Math. Modelling 38, No. 9-10, 2613-2629 (2014). MSC: 90C35 90B10 90C29 PDFBibTeX XMLCite \textit{L. Liu} et al., Appl. Math. Modelling 38, No. 9--10, 2613--2629 (2014; Zbl 1427.90283) Full Text: DOI
Sun, Yu; Dai, Meifeng; Xi, Lifeng Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks. (English) Zbl 1395.60115 Physica A 407, 110-118 (2014). MSC: 60K35 05C82 PDFBibTeX XMLCite \textit{Y. Sun} et al., Physica A 407, 110--118 (2014; Zbl 1395.60115) Full Text: DOI
Kivimäki, Ilkka; Shimbo, Masashi; Saerens, Marco Developments in the theory of randomized shortest paths with a comparison of graph node distances. (English) Zbl 1395.05153 Physica A 393, 600-616 (2014). MSC: 05C80 PDFBibTeX XMLCite \textit{I. Kivimäki} et al., Physica A 393, 600--616 (2014; Zbl 1395.05153) Full Text: DOI arXiv
Dursun, Pinar; Bozdag, Erhan Chance constrained programming models for constrained shortest path problem with fuzzy parameters. (English) Zbl 1394.90545 J. Mult.-Val. Log. Soft Comput. 22, No. 4-6, 599-618 (2014). MSC: 90C35 90C27 90C70 90B10 PDFBibTeX XMLCite \textit{P. Dursun} and \textit{E. Bozdag}, J. Mult.-Val. Log. Soft Comput. 22, No. 4--6, 599--618 (2014; Zbl 1394.90545) Full Text: Link
Smith, Olivia J.; Savelsbergh, Martin W. P. A note on shortest path problems with forbidden paths. (English) Zbl 1390.90187 Networks 63, No. 3, 239-242 (2014). MSC: 90B18 90C39 PDFBibTeX XMLCite \textit{O. J. Smith} and \textit{M. W. P. Savelsbergh}, Networks 63, No. 3, 239--242 (2014; Zbl 1390.90187) Full Text: DOI
Dalfard, Vahid Majazi A new intelligence algorithm for determination of shortest path for dynamic guidance of vehicles based on service level criterion. (English) Zbl 1362.90115 Int. J. Oper. Res. 19, No. 4, 497-512 (2014). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{V. M. Dalfard}, Int. J. Oper. Res. 19, No. 4, 497--512 (2014; Zbl 1362.90115) Full Text: DOI
Bruyère, Véronique; Filiot, Emmanuel; Randour, Mickael; Raskin, Jean-François Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games. (English) Zbl 1360.91042 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 199-213 (2014). MSC: 91A43 90C40 91A05 PDFBibTeX XMLCite \textit{V. Bruyère} et al., LIPIcs -- Leibniz Int. Proc. Inform. 25, 199--213 (2014; Zbl 1360.91042) Full Text: DOI arXiv
Plum, Christian E. M.; Pisinger, David; Salazar-González, Juan-José; Sigurd, Mikkel M. Single liner shipping service design. (English) Zbl 1348.90116 Comput. Oper. Res. 45, 1-6 (2014). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{C. E. M. Plum} et al., Comput. Oper. Res. 45, 1--6 (2014; Zbl 1348.90116) Full Text: DOI
Frieder, Asaf; Roditty, Liam An experimental study on approximating \(k\) shortest simple paths. (English) Zbl 1347.68367 ACM J. Exp. Algorithm. 19, Article No. 1.5, 15 p. (2014). MSC: 68W25 05C20 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Frieder} and \textit{L. Roditty}, ACM J. Exp. Algorithm. 19, Article No. 1.5, 15 p. (2014; Zbl 1347.68367) Full Text: DOI
Kirchler, Dominik; Liberti, Leo; Calvo, Roberto Wolfler Efficient computation of shortest paths in time-dependent multi-modal networks. (English) Zbl 1348.90105 ACM J. Exp. Algorithm. 19, Spec. Iss. 1, Article No. 2.5, 29 p. (2014). MSC: 90B06 05C85 68Q45 90C35 PDFBibTeX XMLCite \textit{D. Kirchler} et al., ACM J. Exp. Algorithm. 19, Article No. 2.5, 29 p. (2014; Zbl 1348.90105) Full Text: DOI
Furian, Nikolaus; Vössner, Siegfried A hybrid algorithm for constrained order packing. (English) Zbl 1339.90281 CEJOR, Cent. Eur. J. Oper. Res. 22, No. 1, 157-186 (2014). MSC: 90C27 90C59 90B20 PDFBibTeX XMLCite \textit{N. Furian} and \textit{S. Vössner}, CEJOR, Cent. Eur. J. Oper. Res. 22, No. 1, 157--186 (2014; Zbl 1339.90281) Full Text: DOI
Ahadi, Arash; Mozafari, Amirhossein; Zarei, Alireza Touring a sequence of disjoint polygons: complexity and extension. (English) Zbl 1338.68253 Theor. Comput. Sci. 556, 45-54 (2014). MSC: 68U05 52B55 68Q17 PDFBibTeX XMLCite \textit{A. Ahadi} et al., Theor. Comput. Sci. 556, 45--54 (2014; Zbl 1338.68253) Full Text: DOI
Pulido, Francisco Javier; Mandow, Lawrence; Pérez de la Cruz, José Luis Multiobjective shortest path problems with lexicographic goal-based preferences. (English) Zbl 1339.90287 Eur. J. Oper. Res. 239, No. 1, 89-101 (2014). MSC: 90C27 90C29 90C35 90C59 PDFBibTeX XMLCite \textit{F. J. Pulido} et al., Eur. J. Oper. Res. 239, No. 1, 89--101 (2014; Zbl 1339.90287) Full Text: DOI
Pascoal, Marta M. B.; Resende, Marisa The minmax regret robust shortest path problem in a finite multi-scenario model. (English) Zbl 1334.90191 Appl. Math. Comput. 241, 88-111 (2014). MSC: 90C35 90B10 90C27 PDFBibTeX XMLCite \textit{M. M. B. Pascoal} and \textit{M. Resende}, Appl. Math. Comput. 241, 88--111 (2014; Zbl 1334.90191) Full Text: DOI Link
Disser, Yann; Mihalák, Matúš; Montanari, Sandro; Widmayer, Peter Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods. (English) Zbl 1445.68158 Fouilhoux, Pierre (ed.) et al., Combinatorial optimization. Third international symposium, ISCO 2014, Lisbon, Portugal, March 5–7, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8596, 208-220 (2014). MSC: 68R10 05C05 05C22 05C38 68Q25 68U05 90C35 PDFBibTeX XMLCite \textit{Y. Disser} et al., Lect. Notes Comput. Sci. 8596, 208--220 (2014; Zbl 1445.68158) Full Text: DOI
Kim, Jinha; Han, Wook-Shin; Oh, Jinoh; Kim, Sungchul; Yu, Hwanjo Processing time-dependent shortest path queries without pre-computed speed information on road networks. (English) Zbl 1320.68221 Inf. Sci. 255, 135-154 (2014). MSC: 68U35 90B20 90C35 PDFBibTeX XMLCite \textit{J. Kim} et al., Inf. Sci. 255, 135--154 (2014; Zbl 1320.68221) Full Text: DOI
Alon, Noga; Emek, Yuval; Feldman, Michal; Tennenholtz, Moshe Economical graph discovery. (English) Zbl 1327.90345 Oper. Res. 62, No. 6, 1236-1246 (2014). MSC: 90C35 PDFBibTeX XMLCite \textit{N. Alon} et al., Oper. Res. 62, No. 6, 1236--1246 (2014; Zbl 1327.90345) Full Text: DOI
Omodeo, Eugenio G.; Tomescu, Alexandru I. Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets. (English) Zbl 1315.68223 J. Autom. Reasoning 52, No. 1, 1-29 (2014). MSC: 68T15 03B35 05C75 PDFBibTeX XMLCite \textit{E. G. Omodeo} and \textit{A. I. Tomescu}, J. Autom. Reasoning 52, No. 1, 1--29 (2014; Zbl 1315.68223) Full Text: DOI
Aichholzer, Oswin; Hackl, Thomas; Korman, Matias; Pilz, Alexander; Vogtenhuber, Birgit Geodesic-preserving polygon simplification. (English) Zbl 1331.68239 Int. J. Comput. Geom. Appl. 24, No. 4, 307-323 (2014). MSC: 68U05 68P05 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Int. J. Comput. Geom. Appl. 24, No. 4, 307--323 (2014; Zbl 1331.68239) Full Text: DOI arXiv
He, Shengxue Determining optimal routes for transit vehicles in no-notice emergency evacuation. (Chinese. English summary) Zbl 1324.90032 Oper. Res. Trans. 18, No. 3, 47-59 (2014). MSC: 90B20 90C11 90C30 90C59 PDFBibTeX XMLCite \textit{S. He}, Oper. Res. Trans. 18, No. 3, 47--59 (2014; Zbl 1324.90032)
Kou, Weihua; Cui, Haoying A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost. (Chinese. English summary) Zbl 1324.90034 J. Harbin Inst. Technol. 46, No. 8, 122-128 (2014). MSC: 90B20 90C35 90B15 PDFBibTeX XMLCite \textit{W. Kou} and \textit{H. Cui}, J. Harbin Inst. Technol. 46, No. 8, 122--128 (2014; Zbl 1324.90034)
Han, Weiyi An improvement on fixed order Bellman-Ford algorithm. (Chinese. English summary) Zbl 1324.90015 J. Harbin Inst. Technol. 46, No. 11, 58-62, 69 (2014). MSC: 90B06 90C35 PDFBibTeX XMLCite \textit{W. Han}, J. Harbin Inst. Technol. 46, No. 11, 58--62, 69 (2014; Zbl 1324.90015)
Gai, Wenmei; Jiang, Zhong’an; Deng, Yunfeng; Li, Jing; Du, Yan Multi-objective route optimization of transporting emergency goods and materials for rescue. (Chinese. English summary) Zbl 1324.90013 J. Univ. Sci. Technol. Beijing (Chin. Ed.) 36, No. 10, 1384-1393 (2014). MSC: 90B06 90B20 90C29 90C59 PDFBibTeX XMLCite \textit{W. Gai} et al., J. Univ. Sci. Technol. Beijing (Chin. Ed.) 36, No. 10, 1384--1393 (2014; Zbl 1324.90013) Full Text: DOI
Zhang, Zhong; Lü, Min; Sun, Guangzhong; Chen, Guoliang An efficient lower-bounding approach to point-to-point shortest path problem. (English) Zbl 1324.90185 J. Univ. Sci. Technol. China 44, No. 10, 874-880 (2014). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{Z. Zhang} et al., J. Univ. Sci. Technol. China 44, No. 10, 874--880 (2014; Zbl 1324.90185) Full Text: DOI
Leng, Xuntai; Sun, Guangzhong An asynchronous parallelism weighted \(\mathrm{A}^*\) algorithm for finding the shortest path on road networks. (Chinese. English summary) Zbl 1324.90028 J. Univ. Sci. Technol. China 44, No. 10, 867-873 (2014). MSC: 90B10 90B20 90C35 90C59 PDFBibTeX XMLCite \textit{X. Leng} and \textit{G. Sun}, J. Univ. Sci. Technol. China 44, No. 10, 867--873 (2014; Zbl 1324.90028) Full Text: DOI
Cheng, Siu-Wing; Jin, Jiongxin Shortest paths on polyhedral surfaces and terrains. (English) Zbl 1315.68253 Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 373-382 (2014). MSC: 68U05 PDFBibTeX XMLCite \textit{S.-W. Cheng} and \textit{J. Jin}, in: Proceedings of the 46th annual ACM symposium on theory of computing, STOC '14, New York, NY, USA, May 31 -- June 3, 2014. New York, NY: Association for Computing Machinery (ACM). 373--382 (2014; Zbl 1315.68253) Full Text: DOI Link
Olya, Mohammad Hessam Applying Dijkstra’s algorithm for general shortest path problem with normal probability distribution arc length. (English) Zbl 1326.90096 Int. J. Oper. Res. 21, No. 2, 143-154 (2014). MSC: 90C35 90C39 90B15 PDFBibTeX XMLCite \textit{M. H. Olya}, Int. J. Oper. Res. 21, No. 2, 143--154 (2014; Zbl 1326.90096) Full Text: DOI
Alkassar, Eyad; Böhme, Sascha; Mehlhorn, Kurt; Rizkallah, Christine A framework for the verification of certifying computations. (English) Zbl 1314.68180 J. Autom. Reasoning 52, No. 3, 241-273 (2014). MSC: 68Q60 68T15 PDFBibTeX XMLCite \textit{E. Alkassar} et al., J. Autom. Reasoning 52, No. 3, 241--273 (2014; Zbl 1314.68180) Full Text: DOI arXiv
Bahel, Eric; Trudeau, Christian Stable lexicographic rules for shortest path games. (English) Zbl 1311.91054 Econ. Lett. 125, No. 2, 266-269 (2014). MSC: 91A43 91A12 PDFBibTeX XMLCite \textit{E. Bahel} and \textit{C. Trudeau}, Econ. Lett. 125, No. 2, 266--269 (2014; Zbl 1311.91054) Full Text: DOI
Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon; Pisinger, David A branch-and-cut algorithm for the capacitated profitable tour problem. (English) Zbl 1308.90206 Discrete Optim. 14, 78-96 (2014). MSC: 90C57 90C27 90C39 PDFBibTeX XMLCite \textit{M. K. Jepsen} et al., Discrete Optim. 14, 78--96 (2014; Zbl 1308.90206) Full Text: DOI
Peng, Zhong-Yuan; Zhong, Yu-Bin; Ge, Lin The application of GA based on the shortest path in optimization of time table problem. (English) Zbl 1308.90214 Cao, Bing-Yuan (ed.) et al., Fuzzy information and engineering and operations research and management. Based on the presentations at the 6th international conference, ICFIE 2012, Babolsar, Iran, October 25–26, 2012 and at the 6th academic conference on fuzzy information and engineering branch of Operation Research Society of China (FIEBORSC 2012), Shenzhen, China, December 18–24, 2012. Berlin: Springer (ISBN 978-3-642-38666-4/pbk; 978-3-642-38667-1/ebook). Advances in Intelligent Systems and Computing 211, 429-438 (2014). MSC: 90C59 90C27 90B35 90C35 PDFBibTeX XMLCite \textit{Z.-Y. Peng} et al., Adv. Intell. Syst. Comput. 211, 429--438 (2014; Zbl 1308.90214) Full Text: DOI
Watanabe, Sennosuke; Watanabe, Yoshihide Min-plus algebra and networks. (English) Zbl 1321.05135 RIMS Kôkyûroku Bessatsu B47, 41-54 (2014). MSC: 05C38 05C12 05C20 05C25 05C82 68R10 68M10 16Y60 PDFBibTeX XMLCite \textit{S. Watanabe} and \textit{Y. Watanabe}, RIMS Kôkyûroku Bessatsu B47, 41--54 (2014; Zbl 1321.05135)
Olya, Mohammad Hessam Finding shortest path in a combined exponential – gamma probability distribution arc length. (English) Zbl 1308.90194 Int. J. Oper. Res. 21, No. 1, 25-37 (2014). MSC: 90C39 90C35 90B15 PDFBibTeX XMLCite \textit{M. H. Olya}, Int. J. Oper. Res. 21, No. 1, 25--37 (2014; Zbl 1308.90194) Full Text: DOI
Elizabeth, S.; Sujatha, L. Fuzzy shortest path problem based on level \(\lambda\)-LR type representation of fuzzy interval. (English) Zbl 1307.90214 Far East J. Math. Sci. (FJMS) 93, No. 1, 43-63 (2014). MSC: 90C70 90C35 PDFBibTeX XMLCite \textit{S. Elizabeth} and \textit{L. Sujatha}, Far East J. Math. Sci. (FJMS) 93, No. 1, 43--63 (2014; Zbl 1307.90214) Full Text: Link
Sommer, Christian Shortest-path queries in static networks. (English) Zbl 1305.68137 ACM Comput. Surv. 46, No. 4, Paper No. 45, 31 p. (2014). MSC: 68R10 05C12 05C38 05C82 05-02 68-02 PDFBibTeX XMLCite \textit{C. Sommer}, ACM Comput. Surv. 46, No. 4, Paper No. 45, 31 p. (2014; Zbl 1305.68137) Full Text: DOI
Wang, Shyue-Liang; Tsai, Zheng-Ze; Ting, I-Hsien; Hong, Tzung-Pei \(k\)-anonymous path privacy on social graphs. (English) Zbl 1305.91201 J. Intell. Fuzzy Syst. 26, No. 3, 1191-1199 (2014). MSC: 91D30 05C82 PDFBibTeX XMLCite \textit{S.-L. Wang} et al., J. Intell. Fuzzy Syst. 26, No. 3, 1191--1199 (2014; Zbl 1305.91201) Full Text: DOI
Dong, Anguo; Song, Jun; Chen, Bo; Zhang, Xianyan Cost partition of multi-path based on vehicle speed on cross-section. (Chinese. English summary) Zbl 1313.90039 Chin. J. Eng. Math. 31, No. 4, 475-483 (2014). MSC: 90B20 91B32 90C35 PDFBibTeX XMLCite \textit{A. Dong} et al., Chin. J. Eng. Math. 31, No. 4, 475--483 (2014; Zbl 1313.90039) Full Text: DOI
Wang, Guangfu Multimedian graphs and their properties. (Chinese. English summary) Zbl 1313.05101 Adv. Math., Beijing 43, No. 3, 360-364 (2014). MSC: 05C12 05C76 PDFBibTeX XMLCite \textit{G. Wang}, Adv. Math., Beijing 43, No. 3, 360--364 (2014; Zbl 1313.05101)
Elalouf, Amir Fast approximation algorithms for routing problems with hop-wise constraints. (English) Zbl 1303.90089 Ann. Oper. Res. 222, 279-291 (2014). MSC: 90C27 90B20 90C35 90C59 PDFBibTeX XMLCite \textit{A. Elalouf}, Ann. Oper. Res. 222, 279--291 (2014; Zbl 1303.90089) Full Text: DOI
Selvarajah, Esaignani; Zhang, Rui Supply chain scheduling to minimize holding costs with outsourcing. (English) Zbl 1303.90053 Ann. Oper. Res. 217, 479-490 (2014). MSC: 90B35 90C59 90C60 PDFBibTeX XMLCite \textit{E. Selvarajah} and \textit{R. Zhang}, Ann. Oper. Res. 217, 479--490 (2014; Zbl 1303.90053) Full Text: DOI
Coco, Amadeu Almeida; Abreu Júnior, João Carlos; Noronha, Thiago F.; Santos, Andréa Cynthia An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. (English) Zbl 1312.90082 J. Glob. Optim. 60, No. 2, 265-287 (2014); erratum ibid. 68, No. 2, 463-466 (2017). MSC: 90C35 90C47 90C10 90C59 PDFBibTeX XMLCite \textit{A. A. Coco} et al., J. Glob. Optim. 60, No. 2, 265--287 (2014; Zbl 1312.90082) Full Text: DOI
Keller, Marcel; Scholl, Peter Efficient, oblivious data structures for MPC. (English) Zbl 1317.94116 Sarkar, Palash (ed.) et al., Advances in cryptology – ASIACRYPT 2014. 20th international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7–11, 2014, Proceedings, Part II. Berlin: Springer (ISBN 978-3-662-45607-1/pbk). Lecture Notes in Computer Science 8874, 506-525 (2014). MSC: 94A60 68P25 68P05 PDFBibTeX XMLCite \textit{M. Keller} and \textit{P. Scholl}, Lect. Notes Comput. Sci. 8874, 506--525 (2014; Zbl 1317.94116) Full Text: DOI
Biswas, Munmun; Mukhopadhyay, Minerva; Ghosh, Anil K. A distribution-free two-sample run test applicable to high-dimensional data. (English) Zbl 1306.62122 Biometrika 101, No. 4, 913-926 (2014). MSC: 62H15 62G10 PDFBibTeX XMLCite \textit{M. Biswas} et al., Biometrika 101, No. 4, 913--926 (2014; Zbl 1306.62122) Full Text: DOI
Zhang, Xiaoge; Wang, Qing; Adamatzky, Andrew; Chan, Felix T. S.; Mahadevan, Sankaran; Deng, Yong A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths. (English) Zbl 1305.65157 J. Optim. Theory Appl. 163, No. 3, 1049-1056 (2014). MSC: 65K05 90C35 PDFBibTeX XMLCite \textit{X. Zhang} et al., J. Optim. Theory Appl. 163, No. 3, 1049--1056 (2014; Zbl 1305.65157) Full Text: DOI
Bolívar, Manuel A.; Lozano, Leonardo; Medaglia, Andrés L. Acceleration strategies for the weight constrained shortest path problem with replenishment. (English) Zbl 1302.90231 Optim. Lett. 8, No. 8, 2155-2172 (2014). MSC: 90C35 PDFBibTeX XMLCite \textit{M. A. Bolívar} et al., Optim. Lett. 8, No. 8, 2155--2172 (2014; Zbl 1302.90231) Full Text: DOI Link
Foschini, Luca; Hershberger, John; Suri, Subhash On the complexity of time-dependent shortest paths. (English) Zbl 1317.68069 Algorithmica 68, No. 4, 1075-1097 (2014). MSC: 68Q25 05C35 05C85 68W25 PDFBibTeX XMLCite \textit{L. Foschini} et al., Algorithmica 68, No. 4, 1075--1097 (2014; Zbl 1317.68069) Full Text: DOI
Cheng, Eddie; Qiu, Ke; Shen, Zhizhang The number of shortest paths in the \((n, k)\)-star graph. (English) Zbl 1303.05087 Discrete Math. Algorithms Appl. 6, No. 4, Article ID 1450051, 17 p. (2014). MSC: 05C30 05C12 05A10 20B25 65Y05 68R10 90B18 PDFBibTeX XMLCite \textit{E. Cheng} et al., Discrete Math. Algorithms Appl. 6, No. 4, Article ID 1450051, 17 p. (2014; Zbl 1303.05087) Full Text: DOI
Maftuleac, Daniela Algorithms for distance problems in planar complexes of global nonpositive curvature. (English) Zbl 1308.68137 Int. J. Comput. Geom. Appl. 24, No. 1, 1-38 (2014). MSC: 68U05 PDFBibTeX XMLCite \textit{D. Maftuleac}, Int. J. Comput. Geom. Appl. 24, No. 1, 1--38 (2014; Zbl 1308.68137) Full Text: DOI arXiv
Koch, Ronald; Nasrabadi, Ebrahim Continuous-time dynamic shortest path problems with negative transit times. (English) Zbl 1331.90089 SIAM J. Control Optim. 52, No. 4, 2449-2481 (2014). MSC: 90C35 05C21 28A25 49J27 49K27 90C49 PDFBibTeX XMLCite \textit{R. Koch} and \textit{E. Nasrabadi}, SIAM J. Control Optim. 52, No. 4, 2449--2481 (2014; Zbl 1331.90089) Full Text: DOI
Cook, Atlas F. IV; Wenk, Carola Shortest path problems on a polyhedral surface. (English) Zbl 1307.68084 Algorithmica 69, No. 1, 58-77 (2014). MSC: 68U05 52B55 PDFBibTeX XMLCite \textit{A. F. Cook IV} and \textit{C. Wenk}, Algorithmica 69, No. 1, 58--77 (2014; Zbl 1307.68084) Full Text: DOI Link
Wang, I-Lin An algebraic decomposed algorithm for all pairs shortest paths. (English) Zbl 1307.05184 Pac. J. Optim. 10, No. 3, 561-576 (2014). Reviewer: Vladimír Lacko (Košice) MSC: 05C70 05C85 05C12 68R10 PDFBibTeX XMLCite \textit{I-L. Wang}, Pac. J. Optim. 10, No. 3, 561--576 (2014; Zbl 1307.05184) Full Text: Link
Chedjou, Jean Chamberlain; Kyamakya, Kyandoghere A novel concept combining neuro-computing and cellular neural networks for shortest path detection in complex and reconfigurable graphs. (English) Zbl 1297.90167 Mladenov, Valeri M. (ed.) et al., Nonlinear dynamics of electronic systems. 22nd international conference, NDES 2014, Albena, Bulgaria, July 4–6, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-08671-2/pbk; 978-3-319-08672-9/ebook). Communications in Computer and Information Science 438, 227-236 (2014). MSC: 90C35 05C38 92B20 68U20 34C60 90C59 PDFBibTeX XMLCite \textit{J. C. Chedjou} and \textit{K. Kyamakya}, Commun. Comput. Inf. Sci. 438, 227--236 (2014; Zbl 1297.90167) Full Text: DOI
Trevizan, Felipe W.; Veloso, Manuela M. Depth-based short-sighted stochastic shortest path problems. (English) Zbl 1405.68331 Artif. Intell. 216, 179-205 (2014). MSC: 68T20 90C35 90C40 PDFBibTeX XMLCite \textit{F. W. Trevizan} and \textit{M. M. Veloso}, Artif. Intell. 216, 179--205 (2014; Zbl 1405.68331) Full Text: DOI
Efentakis, Alexandros; Pfoser, Dieter GRASP. Extending graph separators for the single-source shortest-path problem. (English) Zbl 1423.68336 Schulz, Andreas S. (ed.) et al., Algorithms – ESA 2014. 22nd annual European symposium, Wrocław, Poland, September 8–10, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8737, 358-370 (2014). MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{A. Efentakis} and \textit{D. Pfoser}, Lect. Notes Comput. Sci. 8737, 358--370 (2014; Zbl 1423.68336) Full Text: DOI
Scheffer, Christian Approximation algorithms for geometrical distance problems that are not solvable exactly. (English) Zbl 1303.65006 Münster: Univ. Münster, Mathematisch-Naturwissenschaftliche Fakultät, Fachbereich Mathematik und Informatik (Diss.). x, 149 p. (2014). MSC: 65D18 53C22 PDFBibTeX XMLCite \textit{C. Scheffer}, Approximation algorithms for geometrical distance problems that are not solvable exactly. Münster: Univ. Münster, Mathematisch-Naturwissenschaftliche Fakultät, Fachbereich Mathematik und Informatik (Diss.) (2014; Zbl 1303.65006)
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim The shortest path game: complexity and algorithms. (English) Zbl 1417.68065 Diaz, Josep (ed.) et al., Theoretical computer science. 8th IFIP TC 1/WG 2.2 international conference, TCS 2014, Rome, Italy, September 1–3, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8705, 39-53 (2014). MSC: 68Q25 05C38 05C57 05C85 68Q17 PDFBibTeX XMLCite \textit{A. Darmann} et al., Lect. Notes Comput. Sci. 8705, 39--53 (2014; Zbl 1417.68065) Full Text: DOI arXiv HAL
Xue, Bing; Zuo, Liancui; Wang, Guanghui; Li, Guojun Shortest paths in Sierpiński graphs. (English) Zbl 1297.05123 Discrete Appl. Math. 162, 314-321 (2014). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{B. Xue} et al., Discrete Appl. Math. 162, 314--321 (2014; Zbl 1297.05123) Full Text: DOI
Hinz, Andreas M.; Holz auf der Heide, Caroline An efficient algorithm to determine all shortest paths in Sierpiński graphs. (English) Zbl 1300.05147 Discrete Appl. Math. 177, 111-120 (2014). MSC: 05C38 05C12 05C35 PDFBibTeX XMLCite \textit{A. M. Hinz} and \textit{C. Holz auf der Heide}, Discrete Appl. Math. 177, 111--120 (2014; Zbl 1300.05147) Full Text: DOI
Nikseresht, Ashkan; Sepasdar, Zahra On the Kirchhoff and the Wiener indices of graphs and block decomposition. (English) Zbl 1300.05086 Electron. J. Comb. 21, No. 1, Research Paper P1.25, 13 p. (2014). MSC: 05C12 05C85 05C50 05C38 05C40 PDFBibTeX XMLCite \textit{A. Nikseresht} and \textit{Z. Sepasdar}, Electron. J. Comb. 21, No. 1, Research Paper P1.25, 13 p. (2014; Zbl 1300.05086) Full Text: Link
Guo, Longkun Improved LP-rounding approximations for the \(k\)-disjoint restricted shortest paths problem. (English) Zbl 1409.68332 Chen, Jianer (ed.) et al., Frontiers in algorithmics. 8th international workshop, FAW 2014, Zhangjiajie, China, June 28–30, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8497, 94-104 (2014). MSC: 68W25 05C35 05C38 05C85 68W40 PDFBibTeX XMLCite \textit{L. Guo}, Lect. Notes Comput. Sci. 8497, 94--104 (2014; Zbl 1409.68332) Full Text: DOI
Wu, Zikai; Hou, Baoyu; Zhang, Hongjuan; Jin, Feng Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks. (English) Zbl 1293.05362 Int. J. Mod. Phys. B 28, No. 17, Article ID 1450111, 15 p. (2014). MSC: 05C82 05C81 90B10 PDFBibTeX XMLCite \textit{Z. Wu} et al., Int. J. Mod. Phys. B 28, No. 17, Article ID 1450111, 15 p. (2014; Zbl 1293.05362) Full Text: DOI
Cantone, Domenico; Faro, Simone Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs. (English) Zbl 1334.05162 J. Discrete Algorithms 24, 12-25 (2014). MSC: 05C85 05C22 05C38 68Q25 PDFBibTeX XMLCite \textit{D. Cantone} and \textit{S. Faro}, J. Discrete Algorithms 24, 12--25 (2014; Zbl 1334.05162) Full Text: DOI
Cheng, Siu-Wing; Jin, Jiongxin Approximate shortest descending paths. (English) Zbl 1298.65031 SIAM J. Comput. 43, No. 2, 410-428 (2014). Reviewer: Ivana Linkeová (Praha) MSC: 65D18 68U05 68W25 PDFBibTeX XMLCite \textit{S.-W. Cheng} and \textit{J. Jin}, SIAM J. Comput. 43, No. 2, 410--428 (2014; Zbl 1298.65031) Full Text: DOI Link
Yuan, Linwang; Yu, Zhaoyuan; Luo, Wen; Zhang, Jiyi; Hu, Yong Clifford algebra method for network expression, computation, and algorithm construction. (English) Zbl 1291.90213 Math. Methods Appl. Sci. 37, No. 10, 1428-1435 (2014). MSC: 90C27 05C85 90B10 15A66 PDFBibTeX XMLCite \textit{L. Yuan} et al., Math. Methods Appl. Sci. 37, No. 10, 1428--1435 (2014; Zbl 1291.90213) Full Text: DOI
Shirdel, Gholam Hassan; Abdolhosseinzadeh, Mohsen Arrival probability in the stochastic networks with an established discrete time Markov chain. (English) Zbl 1291.90049 J. Math. Model. 2, No. 1, 74-89 (2014). MSC: 90B15 90C40 PDFBibTeX XMLCite \textit{G. H. Shirdel} and \textit{M. Abdolhosseinzadeh}, J. Math. Model. 2, No. 1, 74--89 (2014; Zbl 1291.90049)
Busch, Costas; Lafortune, Ryan; Tirthapura, Srikanta Sparse covers for planar graphs and graphs that exclude a fixed minor. (English) Zbl 1294.05058 Algorithmica 69, No. 3, 658-684 (2014). MSC: 05C10 05C38 05C35 05C83 PDFBibTeX XMLCite \textit{C. Busch} et al., Algorithmica 69, No. 3, 658--684 (2014; Zbl 1294.05058) Full Text: DOI Link
Tran, Ngoc Mai Polytropes and tropical eigenspaces: cones of linearity. (English) Zbl 1342.14129 Discrete Comput. Geom. 51, No. 3, 539-558 (2014). Reviewer: Péter E. Frenkel (Budapest) MSC: 14T05 52B05 PDFBibTeX XMLCite \textit{N. M. Tran}, Discrete Comput. Geom. 51, No. 3, 539--558 (2014; Zbl 1342.14129) Full Text: DOI arXiv
El Shawi, Radwa; Gudmundsson, Joachim; Levcopoulos, Christos Quickest path queries on transportation network. (English) Zbl 1291.90035 Comput. Geom. 47, No. 7, 695-709 (2014). MSC: 90B06 90B10 PDFBibTeX XMLCite \textit{R. El Shawi} et al., Comput. Geom. 47, No. 7, 695--709 (2014; Zbl 1291.90035) Full Text: DOI arXiv
Murota, Kazuo; Shioura, Akiyoshi Dijkstra’s algorithm and L-concave function maximization. (English) Zbl 1300.90039 Math. Program. 145, No. 1-2 (A), 163-177 (2014). MSC: 90C27 68Q25 PDFBibTeX XMLCite \textit{K. Murota} and \textit{A. Shioura}, Math. Program. 145, No. 1--2 (A), 163--177 (2014; Zbl 1300.90039) Full Text: DOI
Mahadeokar, Jay; Saxena, Sanjeev Faster algorithm to find anti-risk path between two nodes of an undirected graph. (English) Zbl 1291.90287 J. Comb. Optim. 27, No. 4, 798-807 (2014). MSC: 90C39 PDFBibTeX XMLCite \textit{J. Mahadeokar} and \textit{S. Saxena}, J. Comb. Optim. 27, No. 4, 798--807 (2014; Zbl 1291.90287) Full Text: DOI
Drexl, Michael; Irnich, Stefan Solving elementary shortest-path problems as mixed-integer programs. (English) Zbl 1290.90082 OR Spectrum 36, No. 2, 281-296 (2014). MSC: 90C35 90C11 90C05 05C38 PDFBibTeX XMLCite \textit{M. Drexl} and \textit{S. Irnich}, OR Spectrum 36, No. 2, 281--296 (2014; Zbl 1290.90082) Full Text: DOI Link
Csáji, Balázs Csanád; Jungers, Raphaël M.; Blondel, Vincent D. PageRank optimization by edge selection. (English) Zbl 1288.05110 Discrete Appl. Math. 169, 73-87 (2014). MSC: 05C20 05C85 05C81 68R10 68M11 68Q17 PDFBibTeX XMLCite \textit{B. C. Csáji} et al., Discrete Appl. Math. 169, 73--87 (2014; Zbl 1288.05110) Full Text: DOI
Gamst, M. A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem. (English) Zbl 1292.90303 Optim. Lett. 8, No. 3, 919-937 (2014). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{M. Gamst}, Optim. Lett. 8, No. 3, 919--937 (2014; Zbl 1292.90303) Full Text: DOI
Tan, Xuehou; Jiang, Bo Minimization of the maximum distance between the two guards patrolling a polygonal region. (English) Zbl 1417.68252 Theor. Comput. Sci. 532, 73-79 (2014). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{X. Tan} and \textit{B. Jiang}, Theor. Comput. Sci. 532, 73--79 (2014; Zbl 1417.68252) Full Text: DOI
De Carufel, Jean-Lou; Gheibi, Amin; Maheshwari, Anil; Sack, Jörg-Rüdiger; Scheffer, Christian Similarity of polygonal curves in the presence of outliers. (English) Zbl 1287.65013 Comput. Geom. 47, No. 5, 625-641 (2014). Reviewer: H. P. Dikshit (Bhopal) MSC: 65D18 PDFBibTeX XMLCite \textit{J.-L. De Carufel} et al., Comput. Geom. 47, No. 5, 625--641 (2014; Zbl 1287.65013) Full Text: DOI arXiv
Hashemi, Behnam; Tavakolipour, Hanieh; Nasrollahi Shirazi, Mahsa Comparison of the quasi-inverses of the Kronecker sum and product of matrices over complete commutative dioids with applications. (English) Zbl 1286.15006 Linear Algebra Appl. 448, 22-36 (2014). MSC: 15A09 15A24 65Y20 05C50 PDFBibTeX XMLCite \textit{B. Hashemi} et al., Linear Algebra Appl. 448, 22--36 (2014; Zbl 1286.15006) Full Text: DOI
Fischer, Frank; Helmberg, Christoph Dynamic graph generation for the shortest path problem in time expanded networks. (English) Zbl 1303.90116 Math. Program. 143, No. 1-2 (A), 257-297 (2014). Reviewer: Jaroslav Janáček (Žilina) MSC: 90C35 90C06 90B10 PDFBibTeX XMLCite \textit{F. Fischer} and \textit{C. Helmberg}, Math. Program. 143, No. 1--2 (A), 257--297 (2014; Zbl 1303.90116) Full Text: DOI
Asano, Tetsuo; Buchin, Kevin; Buchin, Maike; Korman, Matias; Mulzer, Wolfgang; Rote, Günter; Schulz, André Reprint of: Memory-constrained algorithms for simple polygons. (English) Zbl 06249163 Comput. Geom. 47, No. 3, Part B, 469-479 (2014). MSC: 65D18 PDFBibTeX XMLCite \textit{T. Asano} et al., Comput. Geom. 47, No. 3, Part B, 469--479 (2014; Zbl 06249163) Full Text: DOI
Maccari, Leonardo; Lo Cigno, Renato Betweenness estimation in OLSR-based multi-hop networks for distributed filtering. (English) Zbl 1311.68063 J. Comput. Syst. Sci. 80, No. 3, 670-685 (2014). MSC: 68P25 PDFBibTeX XMLCite \textit{L. Maccari} and \textit{R. Lo Cigno}, J. Comput. Syst. Sci. 80, No. 3, 670--685 (2014; Zbl 1311.68063) Full Text: DOI
Takaoka, Tadao Sharing information for the all pairs shortest path problem. (English) Zbl 1358.05288 Theor. Comput. Sci. 520, 43-50 (2014). MSC: 05C85 05C38 05C35 05C20 68W40 PDFBibTeX XMLCite \textit{T. Takaoka}, Theor. Comput. Sci. 520, 43--50 (2014; Zbl 1358.05288) Full Text: DOI
D’Angelo, Gianlorenzo; D’Emidio, Mattia; Frigioni, Daniele A loop-free shortest-path routing algorithm for dynamic networks. (English) Zbl 1277.68037 Theor. Comput. Sci. 516, 1-19 (2014). MSC: 68M14 68M10 PDFBibTeX XMLCite \textit{G. D'Angelo} et al., Theor. Comput. Sci. 516, 1--19 (2014; Zbl 1277.68037) Full Text: DOI