default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 84
Volume 84, Number 1, 2024
- Saman Ahmadi
, Guido Tack, Daniel Harabor, Philip Kilby, Mahdi Jalili:
Enhanced methods for the weight constrained shortest path problem. 3-30 - Amadeu Almeida Coco, Christophe Duhamel, Andréa Cynthia Santos, Matheus Nohra Haddad:
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters. 31-50 - Jason I. Brown, Theodore Kolokolnikov, Robert E. Kooij:
New approximations for network reliability. 51-63 - Esther Bischoff, Saskia Kohn, Daniela Hahn, Christian Braun, Simon Rothfuß, Sören Hohmann:
Heuristic reoptimization of time-extended multi-robot task allocation problems. 64-83 - Steffen Elting, Jan Fabian Ehmke, Margaretha Gansterer:
Collaborative transportation for attended home deliveries. 84-106
Volume 84, Number 2, 2024
- Pierre-Luc Parent, Margarida Carvalho, Miguel F. Anjos, Ribal Atallah:
Maximum flow-based formulation for the optimal location of electric vehicle charging stations. 109-131 - Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva:
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. 132-147 - Malena Schmidt, Bismark Singh:
Selectively closing recycling centers in Bavaria: Reforming waste-management policy to reduce disparity. 148-160 - Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch:
A flow-based ascending auction to compute buyer-optimal Walrasian prices. 161-180 - Okan Arslan, Gilbert Laporte:
Network design with vulnerability constraints and probabilistic edge reliability. 181-199 - Tasnim Ibn Faiz, Chrysafis Vogiatzis, Jiongbai Liu, Md. Noor-E-Alam:
A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations. 200-219 - José-Fernando Camacho-Vallejo, Dámaris Dávila, Leopoldo Eduardo Cárdenas-Barrón:
A warehouse location-allocation bilevel problem that considers inventory policies. 220-237 - Walid Ben-Ameur, Alessandro Maddaloni:
A cops and robber game and the meeting time of synchronous directed walks. 238-251
Volume 84, Number 3, 2024
- Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Getting linear time in graphs of bounded neighborhood diversity. 255-277 - Andreas Bley, Philipp Hahn:
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis. 278-299 - Shabanaz Chamurally, Julia Rieck:
A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning. 300-325 - Lúcia Martins, Dorabella Santos, Rita Girão-Silva, Teresa Gomes:
A new linear path pair availability constraint for network design. 326-344 - Ruben D'Haen, Katrien Ramaekers, Stef Moons, Kris Braekers:
A real-life study on the value of integrated optimization in order picking operations under dynamic order arrivals. 345-362 - Maite Dewinter, Caroline Jagtenberg, Christophe Vandeviver, Philipp M. Dau, Tom Vander Beken, Frank Witlox:
Reducing police response times: Optimization and simulation of everyday police patrol. 363-381
Volume 84, Number 4, 2024
- Rong Zou, Boyue Lin, Marc Uetz, Matthias Walter:
Algorithmic solutions for maximizing shareable costs. 385-397 - Alexey A. Bochkarev, J. Cole Smith:
Monte Carlo tree search for dynamic shortest-path interdiction. 398-419 - Bissan Ghaddar, Ivana Ljubic, Yuying Qiu:
Three network design problems for community energy storage. 420-445 - Matteo Petris, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet:
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem. 446-464 - Roberto Javier Asín Achá, Alexis Espinoza, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta:
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques. 465-480 - Jan-Erik Justkowiak, Mikhail Y. Kovalyov, Erwin Pesch:
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems. 481-490 - Mustafa Can Camur, Chrysafis Vogiatzis:
A survey on optimization studies of group centrality metrics. 491-508 - Hao Pan, Yajun Lu, Balabhaskar Balasundaram, Juan Sebastian Borrero:
Finding conserved low-diameter subgraphs in social and biological networks. 509-527
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-17 00:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
