Jackiewicz, Marcel; Kasperski, Adam; Zieliński, Paweł Recoverable robust shortest path problem under interval budgeted uncertainty representations. (English) Zbl 07967679 Networks 85, No. 1, 127-141 (2025). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kasperski, Adam; Zieliński, Paweł Approximating the shortest path problem with scenarios. (English) Zbl 07957619 Theor. Comput. Sci. 1025, Article ID 114972, 9 p. (2025). MSC: 90C27 68W25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Tomášek, Petr; Horák, Karel; Bošanský, Branislav Iterative algorithms for solving one-sided partially observable stochastic shortest path games. (English) Zbl 07975895 Int. J. Approx. Reasoning 175, Article ID 109297, 47 p. (2024). MSC: 91Axx 90Cxx 68Txx × Cite Format Result Cite Review PDF Full Text: DOI
Streekstra, Leanne; Trudeau, Christian Stable source connection and assignment problems as multi-period shortest path problems. (English) Zbl 07969308 Int. J. Game Theory 53, No. 3, 939-975 (2024). MSC: 91Axx × Cite Format Result Cite Review PDF Full Text: DOI
Todkar, Aniket S.; Dhodiya, Jayesh M. Enhanced non-dominated sorting genetic algorithms for uncertain multi-objective shortest path problem: application to fire prevention services. (English) Zbl 07968432 Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 32, No. 8, 1215-1244 (2024). MSC: 90C35 90C29 90C59 90C70 90C90 × Cite Format Result Cite Review PDF Full Text: DOI
Bochkarev, Alexey A.; Smith, J. Cole Monte Carlo tree search for dynamic shortest-path interdiction. (English) Zbl 07963645 Networks 84, No. 4, 398-419 (2024). MSC: 91-XX × Cite Format Result Cite Review PDF Full Text: DOI
Ji, Zhen; Mao, Yaping; Cheng, Eddie; Zhang, Xiaoyan Realizability problem of distance-edge-monitoring numbers. (English) Zbl 07963431 RAIRO, Oper. Res. 58, No. 5, 3715-3732 (2024). MSC: 05C12 05C38 05C05 05C76 05C82 × Cite Format Result Cite Review PDF Full Text: DOI
An, Phan Thanh; Hoai, Tran Van; Thinh, Vuong Ba The funnel tree algorithm for finding shortest paths on polyhedral surfaces. (English) Zbl 07960552 Optimization 73, No. 13, 4011-4036 (2024). MSC: 05C85 05C38 05C12 05C05 52B55 52B05 68R10 68W25 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Mizukami, Lena; Itoh, Takeshi; Suzuki, Ken-ichi A fuzzy shortest path model considering path safety. (English) Zbl 07958482 Sci. Math. Jpn. 86, No. 3, 235-244 (2024). MSC: 90C05 × Cite Format Result Cite Review PDF
Ostrovsky, Benjamin Privacy-preserving Dijkstra. (English) Zbl 07958298 Reyzin, Leonid (ed.) et al., Advances in cryptology – CRYPTO 2024. 44th annual international cryptology conference, Santa Barbara, CA, USA, August 18–22, 2024. Proceedings. Part IX. Cham: Springer. Lect. Notes Comput. Sci. 14928, 74-110 (2024). MSC: 68P25 68R10 05C90 05C85 05C38 05C12 05C35 94A60 × Cite Format Result Cite Review PDF Full Text: DOI
An, Phan Thanh; Le, Nguyen Thi Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D. (English) Zbl 07950884 J. Comb. Optim. 47, No. 5, Paper No. 71, 32 p. (2024). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Hersh, Patricia Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology. (English) Zbl 07948157 Discrete Comput. Geom. 72, No. 4, 1463-1492 (2024). MSC: 06A07 52B05 52B12 05E45 90C05 05C12 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kim, Dohan Finding \(k\) shortest paths in Cayley graphs of finite groups. (English) Zbl 07946946 Graphs Comb. 40, No. 6, Paper No. 120, 16 p. (2024). MSC: 05C25 05C38 05C12 05C35 05C30 05A05 16S15 × Cite Format Result Cite Review PDF Full Text: DOI
Saito, Rin; Eto, Hiroshi; Ito, Takehiro; Uehara, Ryuhei Reconfiguration of vertex-disjoint shortest paths on graphs. (English) Zbl 07942905 J. Graph Algorithms Appl. 28, No. 3, 87-101 (2024). MSC: 05C38 05C12 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Gajjar, Kshitij; Jha, Agastya Vibhuti; Kumar, Manish; Lahiri, Abhiruk Reconfiguring shortest paths in graphs. (English) Zbl 07931155 Algorithmica 86, No. 10, 3309-3338 (2024). MSC: 68Wxx 05Cxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Demouge, Céline; Mongeau, Marcel; Couellan, Nicolas; Delahaye, Daniel A time-dependent subgraph-capacity model for multiple shortest paths and application to \(\text{CO}_2\)/contrail-safe aircraft trajectories. (English) Zbl 07928093 SN Oper. Res. Forum 5, No. 3, Paper No. 71, 32 p. (2024). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI
Zhang, Changyong An enhanced Benders decomposition method for unique shortest path routing. (English) Zbl 07921744 Opsearch 61, No. 3, 989-1012 (2024). MSC: 90Bxx × Cite Format Result Cite Review PDF Full Text: DOI
Jüttner, Alpár; Király, Csaba; Mendoza-Cadena, Lydia Mirabel; Pap, Gyula; Schlotter, Ildikó; Yamaguchi, Yutaro Shortest odd paths in undirected graphs with conservative weight functions. (English) Zbl 1547.05074 Discrete Appl. Math. 357, 34-50 (2024). MSC: 05C12 05C38 05C35 05C22 03B16 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Song, Xinyu; Jiang, Zhipeng; Yang, Wenguo; Gao, Suixiang Improving contraction hierarchies by combining with all-pairs shortest paths problem algorithms. (English) Zbl 07914121 Wu, Weili (ed.) et al., Combinatorial optimization and applications. 16th international conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 14462, 431-442 (2024). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Merino, Arturo; Mütze, Torsten Traversing combinatorial 0/1-polytopes via optimization. (English) Zbl 07910862 SIAM J. Comput. 53, No. 5, 1257-1292 (2024). MSC: 90C27 05C38 05C85 52B05 52B11 68R05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Todkar, Aniket; Dhodiya, Jayesh Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services. (English) Zbl 07901711 J. Ind. Manag. Optim. 20, No. 11, 3453-3485 (2024). MSC: 90B06 90B50 68W50 90C29 × Cite Format Result Cite Review PDF Full Text: DOI
Gao, Yucen; Ma, Mingqian; Zhang, Jiale; Zhang, Songjian; Fang, Jun; Gao, Xiaofeng; Chen, Guihai Algorithms for shortest path tour problem in large-scale road network. (English) Zbl 07900453 Wu, Weili (ed.) et al., Computing and combinatorics. 29th international conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 14423, 340-352 (2024). MSC: 68Rxx × Cite Format Result Cite Review PDF Full Text: DOI
Stéphanovitch, Arthur; Tanielian, Ugo; Cadre, Benoît; Klutchnikoff, Nicolas; Biau, Gérard Optimal 1-Wasserstein distance for WGANs. (English) Zbl 1545.60037 Bernoulli 30, No. 4, 2955-2978 (2024). MSC: 60F99 68T05 49Q22 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Velasquez, Alvaro; Wojciechowski, P.; Subramani, K.; Williamson, Matthew Arc-dependent networks: theoretical insights and a computational study. (English) Zbl 1543.90296 Ann. Oper. Res. 338, No. 2-3, 1101-1126 (2024). MSC: 90C35 90C10 90C30 × Cite Format Result Cite Review PDF Full Text: DOI
Salani, Matteo; Basso, Saverio; Giuffrida, Vincenzo PathWyse: a flexible, open-source library for the resource constrained shortest path problem. (English) Zbl 1545.05001 Optim. Methods Softw. 39, No. 2, 298-320 (2024). MSC: 05-04 05-08 90-04 90C35 05C38 90C39 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Boros, Endre; Franciosa, Paolo Giulio; Gurvich, Vladimir; Vyalyi, Michael Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. (English) Zbl 1546.91076 Int. J. Game Theory 53, No. 2, 449-473 (2024). MSC: 91A43 91A05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Grishin, Egor; Musatova, Elena; Lazarev, Alexander Note on a vertex stability radius in the shortest path problem. (English) Zbl 07887247 SN Oper. Res. Forum 5, No. 3, Paper No. 55, 14 p. (2024). MSC: 90C35 90C31 × Cite Format Result Cite Review PDF Full Text: DOI
Domon, Naoki; Suzuki, Akira; Tamura, Yuma; Zhou, Xiao The shortest path reconfiguration problem based on relaxation of reconfiguration rules. (English) Zbl 07883872 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 18th international conference and workshops on algorithms and computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024. Proceedings. Singapore: Springer. Lect. Notes Comput. Sci. 14549, 227-241 (2024). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI
Li, Ruoying; Storandt, Sabine Exact and approximate hierarchical hub labeling. (English) Zbl 07883870 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 18th international conference and workshops on algorithms and computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024. Proceedings. Singapore: Springer. Lect. Notes Comput. Sci. 14549, 194-211 (2024). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI
Song, Maocan; Cheng, Lin; Ge, Huimin; Sun, Chao; Wang, Ruochen Finding the K mean-standard deviation shortest paths under travel time uncertainty. (English) Zbl 07878210 Netw. Spat. Econ. 24, No. 2, 395-423 (2024). MSC: 90Cxx 90Bxx 05Cxx × Cite Format Result Cite Review PDF Full Text: DOI
Dudeja, Chanchal PSO based constraint optimization of intuitionistic fuzzy shortest path problem in an undirected network. (English) Zbl 07876132 Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 32, No. 3, 303-323 (2024). MSC: 90C35 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Ahmadi, Saman; Tack, Guido; Harabor, Daniel; Kilby, Philip; Jalili, Mahdi Enhanced methods for the weight constrained shortest path problem. (English) Zbl 07875582 Networks 84, No. 1, 3-30 (2024). MSC: 90C35 90C29 90C59 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bao, Xiyu; Qi, Meng; Yang, Chenglei; Gai, Wei Voronoi-based splinegon decomposition and shortest-path tree computation. (English) Zbl 07873098 Comput. Aided Geom. Des. 111, Article ID 102316, 20 p. (2024). MSC: 65Dxx × Cite Format Result Cite Review PDF Full Text: DOI
Eğecioğlu, Ömer; Saygi, Elif; Saygi, Zülfükar Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes. (English) Zbl 1540.05087 Discrete Math. Algorithms Appl. 16, No. 3, Article ID 2350027, 10 p. (2024). MSC: 05C38 05A05 11B68 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Castro de Andrade, Rafael; Silva Castelo, Emanuel Elias; Saraiva, Rommel Dias Valid inequalities for the \(k\)-color shortest path problem. (English) Zbl 07864419 Eur. J. Oper. Res. 315, No. 2, 499-510 (2024). MSC: 90Bxx × Cite Format Result Cite Review PDF Full Text: DOI
Himmich, Ilyas; El Hallaoui, Issmail; Soumis, François A multiphase dynamic programming algorithm for the shortest path problem with resource constraints. (English) Zbl 07864417 Eur. J. Oper. Res. 315, No. 2, 470-483 (2024). MSC: 90Bxx × Cite Format Result Cite Review PDF Full Text: DOI
Azizi, Elnaz; Seifi, Abbas Shortest path network interdiction with incomplete information: a robust optimization approach. (English) Zbl 1547.90214 Ann. Oper. Res. 335, No. 2, 727-759 (2024). MSC: 90C35 90C17 × Cite Format Result Cite Review PDF Full Text: DOI
Jovanović, Aleksandar; Uzelac, Ana; Kukić, Katarina; Teodorović, Dušan The shortest-path and bee colony optimization algorithms for traffic control at single intersection with Networkx application. (English) Zbl 1539.65066 Demonstr. Math. 57, Article ID 20230160, 17 p. (2024). MSC: 65K05 90C35 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Bose, Prosenjit; Esteban, Guillermo; Maheshwari, Anil A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. (English) Zbl 07844904 Theor. Comput. Sci. 1001, Article ID 114583, 13 p. (2024). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Padrol, Arnau; Philippe, Eva Sweeps, polytopes, oriented matroids, and allowable graphs of permutations. (English) Zbl 07829394 Combinatorica 44, No. 1, 63-123 (2024). MSC: 52B05 52B11 52B12 52B22 52B40 52C35 52C40 05B35 06B99 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bose, Prosenjit; de Carufel, Jean-Lou; Hill, Darryl; Smid, Michiel On the spanning and routing ratio of the directed theta-four graph. (English) Zbl 1535.05246 Discrete Comput. Geom. 71, No. 3, 872-892 (2024). MSC: 05C85 05C20 05C38 05C35 68R10 65D18 × Cite Format Result Cite Review PDF Full Text: DOI
Borodin, O. V.; Ivanova, A. O. Light 3-paths in 3-polytopes without adjacent triangles. (English. Russian original) Zbl 1535.05073 Sib. Math. J. 65, No. 2, 257-264 (2024); translation from Sib. Mat. Zh. 65, No. 2, 249-257 (2024). MSC: 05C10 05C38 52B05 × Cite Format Result Cite Review PDF Full Text: DOI
Büsing, Christina; Schmitz, Sabrina Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints. (English) Zbl 1540.90231 Discrete Appl. Math. 347, 187-213 (2024). MSC: 90C27 90C17 × Cite Format Result Cite Review PDF Full Text: DOI
Marcucci, Tobia; Umenberger, Jack; Parrilo, Pablo; Tedrake, Russ Shortest paths in graphs of convex sets. (English) Zbl 1543.05042 SIAM J. Optim. 34, No. 1, 507-532 (2024). MSC: 05C12 05C38 05C35 90C11 90C25 90C35 90C57 93C55 93C83 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bahel, Eric; Gómez-Rúa, María; Vidal-Puga, Juan Stable and weakly additive cost sharing in shortest path problems. (English) Zbl 1532.91047 J. Math. Econ. 110, Article ID 102921, 9 p. (2024). MSC: 91B32 91A12 × Cite Format Result Cite Review PDF Full Text: DOI
Davoodi, Mansoor; Safari, Ashkan Path planning in a weighted planar subdivision under the Manhattan metric. (English) Zbl 1531.05129 Graphs Comb. 40, No. 1, Paper No. 16, 24 p. (2024). MSC: 05C38 05C12 05C35 52B05 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Kigami, J.; Takahashi, K. “The Sierpinski gasket minus its bottom line” as a tree of Sierpinski gaskets. (English) Zbl 1542.31004 Math. Z. 306, No. 2, Paper No. 28, 32 p. (2024). Reviewer: Benjamin Steinhurst (Westminster) MSC: 31E05 31C25 28A80 60J45 × Cite Format Result Cite Review PDF Full Text: DOI
Nguyen, Minh Hieu; Baiou, Mourad; Nguyen, Viet Hung; Vo, Thi Quynh Trang Generalized Nash fairness solutions for bi-objective minimization problems. (English) Zbl 1536.90202 Networks 83, No. 1, 83-99 (2024). MSC: 90C29 90C27 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Damelin, Steven B. Near extensions and alignment of data in \(\mathbb R^n\). Whitney extensions of near isometries, shortest paths, equidistribution, clustering and non-rigid alignment of data in Euclidean space. (English) Zbl 07787146 Hoboken, NJ: John Wiley & Sons (ISBN 978-1-394-19677-7/hbk; 978-1-394-19681-4/ebook). xx, 164 p. (2023). MSC: 68-02 42-02 41-02 49-02 60-02 42B35 30H35 30E10 14Q15 53A45 58Z05 68P01 42B37 49J35 49J30 49J10 49J21 46-11 57Z25 68-11 68T09 62G05 41A05 62H30 46T20 26B05 68T45 41A50 15A72 05C38 33D50 58C25 65D18 68U10 94C30 68Q25 11K38 30E05 26E10 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Zuzic, Goran A simple boosting framework for transshipment. (English) Zbl 07961949 Gørtz, Inge Li (ed.) et al., 31st annual European symposium on algorithms, ESA 2023, Amsterdam, The Netherlands, September 4–6, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 274, Article 104, 14 p. (2023). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kaplan, Haim; Katz, Matthew J.; Saban, Rachel; Sharir, Micha The unweighted and weighted reverse shortest path problem for disk graphs. (English) Zbl 07961912 Gørtz, Inge Li (ed.) et al., 31st annual European symposium on algorithms, ESA 2023, Amsterdam, The Netherlands, September 4–6, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 274, Article 67, 14 p. (2023). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
van Ee, Martijn; Oosterwijk, Tim; Sitters, René; Wiese, Andreas Exact and approximation algorithms for routing a convoy through a graph. (English) Zbl 07953335 Leroux, Jérôme (ed.) et al., 48th international symposium on mathematical foundations of computer science, MFCS 2023, Bordeaux, France, August 28 – September 1, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 272, Article 86, 15 p. (2023). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Chakraborty, Dibyayan; Chalopin, Jérémie; Foucaud, Florent; Vaxès, Yann Isometric path complexity of graphs. (English) Zbl 07953281 Leroux, Jérôme (ed.) et al., 48th international symposium on mathematical foundations of computer science, MFCS 2023, Bordeaux, France, August 28 – September 1, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 272, Article 32, 14 p. (2023). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ito, Takehiro; Kakimura, Naonori; Kamiyama, Naoyuki; Kobayashi, Yusuke; Maezawa, Shun-Ichi; Nozaki, Yuta; Okamoto, Yoshio Hardness of finding combinatorial shortest paths on graph associahedra. (English) Zbl 07944120 Etessami, Kousha (ed.) et al., 50th international colloquium on automata, languages, and programming, ICALP 2023, Paderborn, Germany, July 10–14, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 261, Article 82, 17 p. (2023). MSC: 68Nxx 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Borndörfer, Ralf; Danecker, Fabian; Weiser, Martin Convergence properties of Newton’ method for globally optimal free flight trajectory optimization (short paper). (English) Zbl 07900658 Frigioni, Daniele (ed.) et al., 23rd symposium on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS, Amsterdam, The Netherlands, September 7–8, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 115, Article 3, 6 p. (2023). MSC: 90C35 90C26 90C53 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Köhler, Ekkehard; Rogge, Markus; Scheffler, Robert; Strehler, Martin Optimal bicycle routes with few signal stops. (English) Zbl 1545.90024 Frigioni, Daniele (ed.) et al., 23rd symposium on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS, Amsterdam, The Netherlands, September 7–8, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 115, Article 1, 14 p. (2023). MSC: 90B06 90B20 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Stomfai, Gergely; Kovács, Gergely; Nagy, Benedek; Turgay, Neşet Deniz; Vizvári, Béla Distances in the face-centered cubic crystalline structure applying operational research. (English) Zbl 1543.74037 Acta Crystallogr., Sect. A 79, No. 5, 452-462 (2023). MSC: 74E15 74N05 82D25 × Cite Format Result Cite Review PDF Full Text: DOI
Chuzhoy, Julia; Zhang, Ruimin A new deterministic algorithm for fully dynamic all-pairs shortest paths. (English) Zbl 07844662 Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 1159-1172 (2023). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Rozhoň, Václav; Haeupler, Bernhard; Martinsson, Anders; Grunau, Christoph; Zuzic, Goran Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances. (English) Zbl 07844593 Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 321-334 (2023). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Burkov, V. N.; Burkova, I. V.; Kashenkov, A. R. Optimization of group incentive schemes. (English. Russian original) Zbl 1543.90134 Autom. Remote Control 84, No. 12, 1294-1301 (2023); translation from Avtom. Telemekh. 2023, No. 12, 96-105 (2023). MSC: 90B70 90C59 90C90 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Huijuan; Zhan, Xiu-Xiu Information diffusion backbone. From the union of shortest paths to the union of fastest path trees. (English) Zbl 1540.90057 Holme, Petter (ed.) et al., Temporal network theory. Cham: Springer. Comput. Soc. Sci., 203-223 (2023). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Severitt, Marvin; Manns, Paul Efficient solution of discrete subproblems arising in integer optimal control with total variation regularization. (English) Zbl 07822547 INFORMS J. Comput. 35, No. 4, 869-885 (2023). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Caminati, Marco B. Isabelle formalisation of original representation theorems. (English) Zbl 1548.68294 Dubois, Catherine (ed.) et al., Intelligent computer mathematics. 16th international conference, CICM 2023, Cambridge, UK, September 5–8, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14101, 98-112 (2023). MSC: 68V20 05C30 05C90 68Q85 68V15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Heßler, Katrin; Irnich, Stefan Partial dominance in branch-price-and-cut for the basic multicompartment vehicle-routing problem. (English) Zbl 07809818 INFORMS J. Comput. 35, No. 1, 50-65 (2023). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI Link
Weise, Jens; Mostaghim, Sanaz A comparison of distance metrics for the multi-objective pathfinding problem. (English) Zbl 07802714 Nat. Comput. 22, No. 2, 315-328 (2023). MSC: 90C29 68W50 90C59 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Mahloromela, Kabelo; Fabris-Rotelli, Inger; Kraamwinkel, Christine Covariate construction of nonconvex windows for spatial point patterns. (English) Zbl 07800748 S. Afr. Stat. J. 57, No. 2, 65-87 (2023). MSC: 62H11 62P99 × Cite Format Result Cite Review PDF Full Text: DOI
Kaabi, Jihene; Harrath, Youssef; Mahjoub, Amine; Hewahi, Nabil; Abdulsattar, Khadija A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle. (English) Zbl 1531.90043 4OR 21, No. 4, 585-608 (2023). MSC: 90B06 90C27 90C05 68P10 × Cite Format Result Cite Review PDF Full Text: DOI
Deng, Chengyuan; Gao, Jie; Upadhyay, Jalaj; Wang, Chen Differentially private range query on shortest paths. (English) Zbl 07789714 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 340-370 (2023). MSC: 68P05 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bhyravarapu, Sriram; Jana, Satyabrata; Kanesh, Lawqueen; Saurabh, Saket; Verma, Shaily Parameterized algorithms for eccentricity shortest path problem. (English) Zbl 07781726 Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 74-86 (2023). MSC: 68Rxx 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Maristany de las Casas, Pedro; Kraus, Luitgard; Sedeño-Noda, Antonio; Borndörfer, Ralf Targeted multiobjective Dijkstra algorithm. (English) Zbl 1529.90088 Networks 82, No. 3, 277-298 (2023). MSC: 90C59 90C39 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Hamonic, François; Albert, Cécile; Couëtoux, Basile; Vaxès, Yann Optimizing the ecological connectivity of landscapes. (English) Zbl 1529.90065 Networks 81, No. 2, 278-293 (2023). MSC: 90C27 90C35 90C10 90C05 × Cite Format Result Cite Review PDF Full Text: DOI
Szegedy, Mario; Yu, Jingjin An initial study of budgeted Steiner networks. (English) Zbl 1531.68065 CGT, Comput. Geom. Topol. 2, No. 2, Paper No. 4, 13 p. (2023). MSC: 68R10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Klootwijk, Stefan; Manthey, Bodo Probabilistic analysis of optimization problems on sparse random shortest path metrics. (English) Zbl 07777572 Algorithmica 85, No. 12, 3793-3815 (2023). MSC: 68Wxx 05Cxx × Cite Format Result Cite Review PDF Full Text: DOI
Abraham, Ittai; Filtser, Arnold; Gupta, Anupam; Neiman, Ofer Corrigendum to: “Metric embedding via shortest path decompositions”. (English) Zbl 1542.68166 SIAM J. Comput. 52, No. 5, 1319-1320 (2023). MSC: 68R12 46B85 68R10 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Sims, William; Sitharam, Meera Flip paths between lattice triangulations. (English) Zbl 1526.05104 Discrete Appl. Math. 341, 140-163 (2023). MSC: 05C60 05C85 52B55 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Çela, Eranda; Klinz, Bettina; Lendl, Stefan; Woeginger, Gerhard J.; Wulf, Lasse A linear time algorithm for linearizing quadratic and higher-order shortest path problems. (English) Zbl 1528.90209 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 466-479 (2023). MSC: 90C27 90C20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Tafrishi, Seyed Amir; Svinin, Mikhail; Yamamoto, Motoji; Hirata, Yasuhisa A geometric motion planning for a spin-rolling sphere on a plane. (English) Zbl 1525.70038 Appl. Math. Modelling 121, 542-561 (2023). MSC: 70K99 × Cite Format Result Cite Review PDF Full Text: DOI
Borndörfer, Ralf; Danecker, Fabian; Weiser, Martin Newton’s method for global free flight trajectory optimization. (English) Zbl 1532.49030 SN Oper. Res. Forum 4, No. 3, Paper No. 63, 41 p. (2023). Reviewer: Florian Mannel (Lübeck) MSC: 49M15 49M37 65L10 65L70 90C26 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Smirnov, A. V. The optimized algorithm of finding the shortest path in a multiple graph. (Russian. English summary) Zbl 1521.05201 Model. Anal. Inf. Sist. 30, No. 1, 6-15 (2023). MSC: 05C85 05C38 × Cite Format Result Cite Review PDF Full Text: DOI MNR
Tayyebi, Javad; Deaconu, Adrian M.; Bigdeli, Hamid; Niksirat, Malihe Shortest path interdiction problem with convex piecewise-linear costs. (English) Zbl 1538.90041 Comput. Appl. Math. 42, No. 7, Paper No. 309, 20 p. (2023). MSC: 90B10 90C35 90C27 91A65 × Cite Format Result Cite Review PDF Full Text: DOI
Carvalho, Iago A.; Noronha, Thiago F.; Duhamel, Christophe; Vieira, Luiz F. M.; dos Santos, Vinicius F. A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty. (English) Zbl 07744682 Int. Trans. Oper. Res. 30, No. 2, 1120-1143 (2023). MSC: 90-XX × Cite Format Result Cite Review PDF Full Text: DOI
Nunes, Pedro; Moura, Ana; Santos, José Solving the multi-objective bike routing problem by meta-heuristic algorithms. (English) Zbl 07744668 Int. Trans. Oper. Res. 30, No. 2, 717-741 (2023). MSC: 90-XX × Cite Format Result Cite Review PDF Full Text: DOI
Ardizzoni, Stefano; Consolini, Luca; Laurini, Mattia; Locatelli, Marco Solution algorithms for the bounded acceleration shortest path problem. (English) Zbl 1546.49030 IEEE Trans. Autom. Control 68, No. 3, 1910-1917 (2023). MSC: 49K05 49N90 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Borndörfer, Ralf; Danecker, Fabian; Weiser, Martin Error bounds for discrete-continuous free flight trajectory optimization. (English) Zbl 1522.90239 J. Optim. Theory Appl. 198, No. 2, 830-856 (2023). MSC: 90C35 65L10 65L70 90C27 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Horn, Melanie; Müller, Christine H. Sign depth tests in multiple regression. (English) Zbl 07739598 J. Stat. Comput. Simulation 93, No. 7, 1169-1191 (2023). MSC: 62-XX 62J20 62F03 62F35 62G10 × Cite Format Result Cite Review PDF Full Text: DOI
Haslegrave, John Monitoring edge-geodetic sets: hardness and graph products. (English) Zbl 1521.05190 Discrete Appl. Math. 340, 79-84 (2023). MSC: 05C82 05C76 05C12 05C38 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Tsemogne, Olivier; Hayel, Yezekael; Kamhoua, Charles; Deugoué, Gabriel Optimizing intrusion detection systems placement against network virus spreading using a partially observable stochastic minimum-threat path game. (English) Zbl 1529.68069 Fang, Fei (ed.) et al., Decision and game theory for security. 13th international conference, GameSec 2022, Pittsburgh, PA, USA, October 26–28, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13727, 274-296 (2023). MSC: 68M25 91A15 91A43 91A80 × Cite Format Result Cite Review PDF Full Text: DOI
Laforest, Christian; Martinod, Timothée Introduction to routing problems with mandatory transitions. (English) Zbl 1531.68059 Gąsieniec, Leszek (ed.), SOFSEM 2023: theory and practice of computer science. 48th international conference on current trends in theory and practice of computer science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13878, 254-266 (2023). MSC: 68R10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Leitner, Markus; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus; Tanınmış, Kübra An exact method for binary fortification games. (English) Zbl 07709062 Eur. J. Oper. Res. 307, No. 3, 1026-1039 (2023). MSC: 90Bxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cerulli, Raffaele; Guerriero, Francesca; Scalzo, Edoardo; Sorgente, Carmine Shortest paths with exclusive-disjunction arc pairs conflicts. (English) Zbl 1542.90237 Comput. Oper. Res. 152, Article ID 106158, 13 p. (2023). MSC: 90C35 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Wu, Wei; Hayashi, Takito; Haruyasu, Kato; Tang, Liang Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems. (English) Zbl 1541.90177 Eur. J. Oper. Res. 307, No. 1, 82-102 (2023). MSC: 90B35 × Cite Format Result Cite Review PDF Full Text: DOI
Marohnić, Luka A model for tonal progressions of seventh chords. (English) Zbl 1535.00036 J. Math. Music 17, No. 1, 78-99 (2023). MSC: 00A65 05C90 × Cite Format Result Cite Review PDF Full Text: DOI
Bose, Prosenjit; Esteban, Guillermo; Orden, David; Silveira, Rodrigo I. On approximating shortest paths in weighted triangular tessellations. (English) Zbl 07702937 Artif. Intell. 318, Article ID 103898, 13 p. (2023). MSC: 68Txx × Cite Format Result Cite Review PDF Full Text: DOI
Klost, Katharina An algorithmic framework for the single source shortest path problem with applications to disk graphs. (English) Zbl 1516.05210 Comput. Geom. 111, Article ID 101979, 12 p. (2023). MSC: 05C85 68Q17 05C12 05C38 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Crispino, Gabriel Nunes; Freire, Valdinei; Valdivia Delgado, Karina GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory. (English) Zbl 07697288 Artif. Intell. 316, Article ID 103848, 45 p. (2023). MSC: 68Txx × Cite Format Result Cite Review PDF Full Text: DOI
Hong, Sungkweon; Williams, Brian C. An anytime algorithm for constrained stochastic shortest path problems with deterministic policies. (English) Zbl 07697286 Artif. Intell. 316, Article ID 103846, 36 p. (2023). MSC: 68Txx × Cite Format Result Cite Review PDF Full Text: DOI
Tayyebi, Javad; Amirteymoori, Alireza Further study on “An extended shortest path problem a data envelopment analysis approach”. (English) Zbl 1524.90331 Commun. Comb. Optim. 8, No. 1, 253-259 (2023). MSC: 90C35 05C38 90C29 90C08 × Cite Format Result Cite Review PDF Full Text: DOI
Trang, Le Hong; Le, Nguyen Thi; An, Phan Thanh Finding approximately convex ropes in the plane. (English) Zbl 1514.52007 J. Convex Anal. 30, No. 1, 249-270 (2023). MSC: 52A27 52A10 52B55 68Q25 90C26 65D18 68R01 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Zhang, Qiao; Guan, Xiucui; Jia, Junhua; Qian, Xinqiang; Pardalos, Panos M. The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees. (English) Zbl 1518.90099 J. Glob. Optim. 86, No. 1, 251-284 (2023). MSC: 90C27 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Ketkov, Sergey S. On the multistage shortest path problem under distributional uncertainty. (English) Zbl 1517.90094 J. Optim. Theory Appl. 197, No. 1, 277-308 (2023). MSC: 90C17 90C27 90C47 × Cite Format Result Cite Review PDF Full Text: DOI arXiv