default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudia Archetti
Person information
- affiliation: ESSEC Business School, Cergy-Pontoise, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j95]Debajyoti Biswas
, Laurent Alfandari, Claudia Archetti:
A Triple Bottom Line optimization model for assignment and routing of on-demand home services. Comput. Oper. Res. 167: 106644 (2024)- [j94]Ruben D'Haen, Katrien Ramaekers, Claudia Archetti, Kris Braekers:
Integrating order picking and vehicle routing decisions in a dynamic e-commerce setting. Comput. Oper. Res. 170: 106762 (2024) - [j93]Ali Diabat, Nicola Bianchessi, Claudia Archetti:
On the zero-inventory-ordering policy in the inventory routing problem. Eur. J. Oper. Res. 312(3): 1024-1038 (2024) - [j92]Claudia Archetti, Francesco Carrabs, Raffaele Cerulli, Federica Laureana:
A new formulation and a branch-and-cut algorithm for the set orienteering problem. Eur. J. Oper. Res. 314(2): 446-465 (2024) - [j91]Claudia Archetti, Francesco Carrabs, Raffaele Cerulli, Federica Laureana:
Corrigendum to "A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem" [European Journal of Operational Research, Volume 314, Issue 2, 16 April 2024, Pages 446-465]. Eur. J. Oper. Res. 316(2): 798 (2024) - [j90]Wenjuan Gu, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet, M. Grazia Speranza:
Vehicle routing problems with multiple commodities: A survey. Eur. J. Oper. Res. 317(1): 1-15 (2024) - [j89]Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - [j88]Claudia Archetti, Eduardo Uchoa, Thibaut Vidal:
Special Section on "DIMACS Implementation Challenge: Vehicle Routing" and "The EURO Meets NeurIPS 2022 Vehicle Routing Competition". Transp. Sci. 58(4): 685-686 (2024) - [j87]Martina Cerulli, Claudia Archetti, Elena Fernández, Ivana Ljubic:
A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery. Transp. Sci. 58(5): 1076-1100 (2024) - [j86]Yuanyuan Li, Claudia Archetti, Ivana Ljubic:
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. Transp. Sci. 58(5): 1143-1165 (2024) - [i2]Claudia Archetti, Martina Cerulli, Carmine Sorgente:
Branch-and-cut algorithms for colorful components problems. CoRR abs/2408.16508 (2024) - 2023
- [j85]Claudia Archetti, Maurizio Bruglieri, Gianfranco Guastaroba, M. Grazia Speranza:
The benefit of complete trip information in free-floating carsharing systems. EURO J. Transp. Logist. 12: 100110 (2023) - [j84]Andrea Di Placido, Claudia Archetti, Carmine Cerrone, Bruce L. Golden:
The generalized close enough traveling salesman problem. Eur. J. Oper. Res. 310(3): 974-991 (2023) - [j83]Martina Cerulli, Domenico Serra, Carmine Sorgente, Claudia Archetti, Ivana Ljubic:
Mathematical programming formulations for the Collapsed k-Core Problem. Eur. J. Oper. Res. 311(1): 56-72 (2023) - [j82]Alberto Santini, Claudia Archetti:
The hazardous orienteering problem. Networks 81(2): 235-252 (2023) - [j81]Nho Minh Dinh, Claudia Archetti, Luca Bertazzi:
The inventory routing problem with split deliveries. Networks 82(4): 400-413 (2023) - 2022
- [j80]Wenjuan Gu, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet, M. Grazia Speranza:
A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Ind. Eng. 163: 107793 (2022) - [j79]Diana L. Huerta-Muñoz, Claudia Archetti, Elena Fernández, Federico Perea:
The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms. Comput. Oper. Res. 141: 105662 (2022) - [j78]Andrea Di Placido, Claudia Archetti, Carmine Cerrone:
A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance. Comput. Oper. Res. 145: 105831 (2022) - [j77]Javaiz Parappathodi, Claudia Archetti:
Crowdsourced humanitarian relief vehicle routing problem. Comput. Oper. Res. 148: 105963 (2022) - [j76]Claudia Archetti, Lorenzo Peirano, M. Grazia Speranza:
Optimization in multimodal freight transportation problems: A Survey. Eur. J. Oper. Res. 299(1): 1-20 (2022) - [j75]Manuel Trotta, Claudia Archetti, Dominique Feillet, Alain Quilliot:
Pickup and delivery problems with autonomous vehicles on rings. Eur. J. Oper. Res. 300(1): 221-236 (2022) - [j74]Melih Çelik, Claudia Archetti, Haldun Süral:
Inventory routing in a warehouse: The storage replenishment routing problem. Eur. J. Oper. Res. 301(3): 1117-1132 (2022) - [j73]Claudia Archetti, Ivana Ljubic:
Comparison of formulations for the Inventory Routing Problem. Eur. J. Oper. Res. 303(3): 997-1008 (2022) - [i1]Yuanyuan Li, Claudia Archetti, Ivana Ljubic:
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. CoRR abs/2207.00885 (2022) - 2021
- [j72]Claudia Archetti, Francesca Guerriero, Giusy Macrina:
The online vehicle routing problem with occasional drivers. Comput. Oper. Res. 127: 105144 (2021) - [j71]Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni:
A dynamic and probabilistic orienteering problem. Comput. Oper. Res. 136: 105454 (2021) - [j70]Claudia Archetti, Gianfranco Guastaroba, Diana L. Huerta-Muñoz, M. Grazia Speranza:
A kernel search heuristic for the multivehicle inventory routing problem. Int. Trans. Oper. Res. 28(6): 2984-3013 (2021) - [j69]Claudia Archetti, Luca Bertazzi:
Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery. Networks 77(2): 255-268 (2021) - [j68]Ali Diabat, Claudia Archetti, Waleed Najy:
The Fixed-Partition Policy Inventory Routing Problem. Transp. Sci. 55(2): 353-370 (2021) - [c3]Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, M. Grazia Speranza:
The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk). CP 2021: 1:1-1:1 - 2020
- [j67]Enrico Angelelli, Claudia Archetti, Lorenzo Peirano:
A matheuristic for the air transportation freight forwarder service problem. Comput. Oper. Res. 123: 105002 (2020) - [j66]Claudia Archetti, Jean-François Cordeau, Guy Desaulniers:
Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling. EURO J. Transp. Logist. 9(4): 100024 (2020) - [j65]Claudia Archetti, Dominique Feillet, Andrea Mor, Maria Grazia Speranza:
Dynamic traveling salesman problem with stochastic release dates. Eur. J. Oper. Res. 280(3): 832-844 (2020) - [j64]Claudia Archetti, M. Grazia Speranza, Maurizio Boccia, Antonio Sforza, Claudio Sterle:
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 282(3): 886-895 (2020)
2010 – 2019
- 2019
- [j63]Homero Larrain, Leandro C. Coelho, Claudia Archetti, M. Grazia Speranza:
Exact solution methods for the multi-period vehicle routing problem with due dates. Comput. Oper. Res. 110: 148-158 (2019) - [j62]Maryam Darvish, Claudia Archetti, Leandro C. Coelho, M. Grazia Speranza:
Flexible two-echelon location routing problem. Eur. J. Oper. Res. 277(3): 1124-1136 (2019) - [j61]Maciek Nowak, Claudia Archetti, Bogumil Kaminski:
Preface: Special issue on the future of route optimization/vehicle routing. Networks 73(4): 379-381 (2019) - 2018
- [j60]Claudia Archetti, Dominique Feillet, Andrea Mor, M. Grazia Speranza:
An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. Comput. Oper. Res. 98: 24-37 (2018) - [j59]Claudia Archetti, Elena Fernández, Diana L. Huerta-Muñoz:
A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. Comput. Oper. Res. 99: 27-37 (2018) - [j58]Claudia Archetti, Luca Bertazzi, Martin Milanic, David Schindl, Sacha Varone:
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. Discret. Appl. Math. 234: 1-2 (2018) - [j57]Claudia Archetti, Francesco Carrabs, Raffaele Cerulli:
The Set Orienteering Problem. Eur. J. Oper. Res. 267(1): 264-272 (2018) - [j56]Claudia Archetti, Marielle Christiansen, M. Grazia Speranza:
Inventory routing with pickups and deliveries. Eur. J. Oper. Res. 268(1): 314-324 (2018) - [j55]Nabil Absi, Claudia Archetti, Stéphane Dauzère-Pérès, Dominique Feillet, M. Grazia Speranza:
Comparing sequential and integrated approaches for the production routing problem. Eur. J. Oper. Res. 269(2): 633-646 (2018) - [j54]Claudia Archetti, M. Grazia Speranza, Dennis Weyland:
A simulation study of an on-demand transportation system. Int. Trans. Oper. Res. 25(4): 1137-1161 (2018) - 2017
- [j53]Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni:
The probabilistic orienteering problem. Comput. Oper. Res. 81: 269-281 (2017) - [j52]Claudia Archetti, Elena Fernández, Diana L. Huerta-Muñoz:
The Flexible Periodic Vehicle Routing Problem. Comput. Oper. Res. 85: 58-70 (2017) - [j51]Claudia Archetti, Guy Desaulniers, M. Grazia Speranza:
Minimizing the logistic ratio in the inventory routing problem. EURO J. Transp. Logist. 6(4): 289-306 (2017) - [j50]Claudia Archetti, Luca Bertazzi, Demetrio Laganà, Francesca Vocaturo:
The Undirected Capacitated General Routing Problem with Profits. Eur. J. Oper. Res. 257(3): 822-833 (2017) - [j49]Claudia Archetti, Natashia Boland, M. Grazia Speranza:
A Matheuristic for the Multivehicle Inventory Routing Problem. INFORMS J. Comput. 29(3): 377-387 (2017) - 2016
- [j48]Claudia Archetti, Ángel Corberán, Isaac Plana, José M. Sanchis, M. Grazia Speranza:
A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Comput. Oper. Res. 66: 95-104 (2016) - [j47]Claudia Archetti, Martin W. P. Savelsbergh, M. Grazia Speranza:
The Vehicle Routing Problem with Occasional Drivers. Eur. J. Oper. Res. 254(2): 472-480 (2016) - [j46]Claudia Archetti, M. Grazia Speranza:
The inventory routing problem: the value of integration. Int. Trans. Oper. Res. 23(3): 393-407 (2016) - [j45]Claudia Archetti, Ann Melissa Campbell, M. Grazia Speranza:
Multicommodity vs. Single-Commodity Routing. Transp. Sci. 50(2): 461-472 (2016) - 2015
- [j44]Claudia Archetti, Ola Jabali, M. Grazia Speranza:
Multi-period Vehicle Routing Problem with Due dates. Comput. Oper. Res. 61: 122-134 (2015) - [j43]Claudia Archetti, Nicola Bianchessi, M. Grazia Speranza:
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Comput. Oper. Res. 64: 1-10 (2015) - [j42]Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon:
Directed weighted improper coloring for cellular channel allocation. Discret. Appl. Math. 182: 46-60 (2015) - [j41]Claudia Archetti, Angel Corberán, Isaac Plana, José María Sanchis, M. Grazia Speranza:
A matheuristic for the Team Orienteering Arc Routing Problem. Eur. J. Oper. Res. 245(2): 392-401 (2015) - [j40]Claudia Archetti, Dominique Feillet, M. Grazia Speranza:
Complexity of routing problems with release dates. Eur. J. Oper. Res. 247(3): 797-803 (2015) - [j39]Gábor Nagy, Niaz A. Wassan, Maria Grazia Speranza, Claudia Archetti:
The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transp. Sci. 49(2): 271-294 (2015) - [j38]Nabil Absi, Claudia Archetti, Stéphane Dauzère-Pérès, Dominique Feillet:
A Two-Phase Iterative Heuristic Approach for the Production Routing Problem. Transp. Sci. 49(4): 784-795 (2015) - 2014
- [j37]Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza:
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. Discret. Appl. Math. 163: 3-16 (2014) - [j36]Claudia Archetti, Nicola Bianchessi, Alain Hertz:
A branch-and-price algorithm for the robust graph coloring problem. Discret. Appl. Math. 165: 49-59 (2014) - [j35]Claudia Archetti, David Pisinger, M. Grazia Speranza:
Special issue on: "matheuristics". EURO J. Comput. Optim. 2(4): 221-222 (2014) - [j34]Claudia Archetti, M. Grazia Speranza:
A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4): 223-246 (2014) - [j33]Claudio Arbib, Mara Servilio, Claudia Archetti, Maria Grazia Speranza:
The directed profitable location Rural Postman Problem. Eur. J. Oper. Res. 236(3): 811-819 (2014) - [j32]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Polynomial cases of the economic lot sizing problem with cost discounts. Eur. J. Oper. Res. 237(2): 519-527 (2014) - [j31]Enrico Angelelli, Claudia Archetti, Michele Vindigni:
The Clustered Orienteering Problem. Eur. J. Oper. Res. 238(2): 404-414 (2014) - [j30]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238(3): 685-698 (2014) - [j29]Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza:
Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21(3): 353-374 (2014) - [j28]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
The split delivery capacitated team orienteering problem. Networks 63(1): 16-33 (2014) - [j27]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
Incomplete service and split deliveries in a routing problem with profits. Networks 63(2): 135-145 (2014) - [j26]Claudia Archetti, Maria Grazia Speranza, Angel Corberán, José M. Sanchis, Isaac Plana:
The Team Orienteering Arc Routing Problem. Transp. Sci. 48(3): 442-457 (2014) - [c2]Claudia Archetti, Maria Grazia Speranza:
The Value Of Integration In Logistics. ECMS 2014: 691-697 - [p1]Claudia Archetti, M. Grazia Speranza, Daniele Vigo:
Vehicle Routing Problems with Profits. Vehicle Routing 2014: 273-297 - [e1]Flaminio Squazzoni, Fabio Baronio, Claudia Archetti, Marco Castellani:
28th European Conference on Modelling and Simulation, ECMS 2014, Brescia, Italy, May 27-30, 2014. European Council for Modeling and Simulation 2014, ISBN 978-0-9564944-8-1 [contents] - 2013
- [j25]Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza:
Reoptimizing the rural postman problem. Comput. Oper. Res. 40(5): 1306-1313 (2013) - [j24]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4-5): 547-557 (2013) - [j23]Claudia Archetti, Karl F. Doerner, Fabien Tricoire:
A heuristic algorithm for the free newspaper delivery problem. Eur. J. Oper. Res. 230(2): 245-257 (2013) - [j22]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
The capacitated team orienteering problem with incomplete service. Optim. Lett. 7(7): 1405-1417 (2013) - 2012
- [j21]Asvin Goel, Claudia Archetti, Martin W. P. Savelsbergh:
Truck driver scheduling in Australia. Comput. Oper. Res. 39(5): 1122-1132 (2012) - [j20]Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza:
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24(1): 101-116 (2012) - [j19]Claudia Archetti, Maria Grazia Speranza:
Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19(1-2): 3-22 (2012) - [j18]Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin:
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4): 212-226 (2012) - 2011
- [j17]Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12): 1731-1746 (2011) - [j16]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
A column generation approach for the split delivery vehicle routing problem. Networks 58(4): 241-254 (2011) - [j15]Claudia Archetti, Mathieu Bouchard, Guy Desaulniers:
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. Transp. Sci. 45(3): 285-298 (2011) - 2010
- [j14]Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza:
The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37(11): 1860-1869 (2010) - [j13]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Reoptimizing the 0-1 knapsack problem. Discret. Appl. Math. 158(17): 1879-1887 (2010) - [j12]Hanne L. Petersen, Claudia Archetti, Maria Grazia Speranza:
Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4): 229-243 (2010)
2000 – 2009
- 2009
- [j11]Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza:
The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6): 831-842 (2009) - [j10]Claudia Archetti, Martin W. P. Savelsbergh:
The Trip Scheduling Problem. Transp. Sci. 43(4): 417-431 (2009) - 2008
- [j9]Liangjun Ke, Claudia Archetti, Zuren Feng:
Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3): 648-665 (2008) - [j8]Claudia Archetti, Maria Grazia Speranza, Martin W. P. Savelsbergh:
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transp. Sci. 42(1): 22-31 (2008) - 2007
- [j7]Claudia Archetti, Alain Hertz, Maria Grazia Speranza:
Metaheuristics for the team orienteering problem. J. Heuristics 13(1): 49-76 (2007) - [j6]Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza:
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transp. Sci. 41(3): 382-391 (2007) - 2006
- [j5]Claudia Archetti, Maria Grazia Speranza, Alain Hertz:
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transp. Sci. 40(1): 64-73 (2006) - [j4]Claudia Archetti, Martin W. P. Savelsbergh, Maria Grazia Speranza:
Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transp. Sci. 40(2): 226-234 (2006) - [c1]Claudia Archetti, Maria Grazia Speranza:
An Overview on the Split Delivery Vehicle Routing Problem. OR 2006: 123-127 - 2005
- [j3]Claudia Archetti, Renata Mansini, Maria Grazia Speranza:
Complexity and Reducibility of the Skip Delivery Problem. Transp. Sci. 39(2): 182-187 (2005) - 2004
- [j2]Claudia Archetti, M. Grazia Speranza:
Vehicle routing in the 1-skip collection problem. J. Oper. Res. Soc. 55(7): 717-727 (2004) - 2003
- [j1]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Reoptimizing the traveling salesman problem. Networks 42(3): 154-159 (2003)
Coauthor Index
Maria Grazia Speranza
aka: M. Grazia Speranza
aka: M. Grazia Speranza
[j90] [j85] [j80] [j76] [j70] [c3] [j65] [j64] [j63] [j62] [j60] [j56] [j55] [j54] [j51] [j49] [j48] [j47] [j46] [j45] [j44] [j43] [j41] [j40] [j39] [j37] [j35] [j34] [j33] [j32] [j30] [j29] [j28] [j27] [j26] [c2] [p1] [j25] [j24] [j22] [j20] [j19] [j18] [j17] [j16] [j14] [j13] [j12] [j11] [j8] [j7] [j6] [j5] [j4] [c1] [j3] [j2] [j1]
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:10 CET 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:
