default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam N. Letchford
Person information
- affiliation: Lancaster University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j102]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)- [j101]Michael Malmros Sørensen, Adam N. Letchford:
CP-Lib: Benchmark Instances of the Clique Partitioning Problem. Math. Program. Comput. 16(1): 93-111 (2024) - [j100]Laura Galli, Adam N. Letchford:
On upper bounds for the multiple knapsack assignment problem. Oper. Res. Lett. 54: 107104 (2024) - [j99]Adam N. Letchford, Licong Cheng:
On a variant of the change-making problem. Oper. Res. Lett. 57: 107165 (2024) - 2023
- [j98]Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford:
On some lower bounds for the permutation flowshop problem. Comput. Oper. Res. 159: 106320 (2023) - [j97]Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
On cut polytopes and graph minors. Discret. Optim. 50: 100807 (2023) - [j96]Marco A. Boschetti, Adam N. Letchford, Vittorio Maniezzo:
Matheuristics: survey and synthesis. Int. Trans. Oper. Res. 30(6): 2840-2866 (2023) - [j95]Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
Improving a constructive heuristic for the general routing problem. Networks 81(1): 93-106 (2023) - [j94]Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
Fast upper and lower bounds for a large-scale real-world arc routing problem. Networks 81(1): 107-124 (2023) - [j93]Oliverio Cruz-Mejia, Adam N. Letchford:
A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks 82(2): 167-176 (2023) - 2022
- [j92]Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford:
A cut-and-branch algorithm for the Quadratic Knapsack Problem. Discret. Optim. 44(Part): 100579 (2022) - [j91]Congzheng Liu, Adam N. Letchford, Ivan Svetunkov:
Newsvendor problems: An integrated method for estimation and optimisation. Eur. J. Oper. Res. 300(2): 590-601 (2022) - [j90]Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
On matchings, T-joins, and arc routing in road networks. Networks 79(1): 20-31 (2022) - [j89]Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
Generalised 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 50(2): 122-128 (2022) - [j88]Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor:
Revisiting surrogate relaxation for the multidimensional knapsack problem. Oper. Res. Lett. 50(6): 674-678 (2022) - 2021
- [j87]Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
Vehicle routing on road networks: How good is Euclidean approximation? Comput. Oper. Res. 129: 105197 (2021) - [j86]Laura Galli, Adam N. Letchford:
Valid inequalities for quadratic optimisation with domain constraints. Discret. Optim. 41: 100661 (2021) - [j85]Adam N. Letchford, Anh N. Vu:
Facets from gadgets. Math. Program. 185(1-2): 297-314 (2021) - [j84]Adam N. Letchford, Qiang Ni, Zhaoyu Zhong:
Bi-perspective functions for mixed-integer fractional programs with indicator variables. Math. Program. 190(1): 39-55 (2021) - [j83]Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor:
On the complexity of surrogate and group relaxation for integer linear programs. Oper. Res. Lett. 49(4): 530-534 (2021) - [j82]Adam N. Letchford, Paolo Ventura:
Strengthened clique-family inequalities for the stable set polytope. Oper. Res. Lett. 49(4): 586-589 (2021) - [j81]Laura Galli, Adam N. Letchford:
A separation algorithm for the simple plant location problem. Oper. Res. Lett. 49(4): 610-615 (2021) - 2020
- [j80]Tolga Bektas, Adam N. Letchford:
Using ℓp-norms for fairness in combinatorial optimisation. Comput. Oper. Res. 120: 104975 (2020) - [j79]Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
The stable set problem: Clique and nodal inequalities revisited. Comput. Oper. Res. 123: 105024 (2020) - [j78]Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
On matroid parity and matching polytopes. Discret. Appl. Math. 284: 322-331 (2020) - [j77]James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford:
Adaptive policies for perimeter surveillance problems. Eur. J. Oper. Res. 283(1): 265-278 (2020) - [j76]Adam N. Letchford, Qiang Ni, Zhaoyu Zhong:
A heuristic for fair dynamic resource allocation in overloaded OFDMA systems. J. Heuristics 26(1): 21-32 (2020) - [j75]Adam N. Letchford, Georgia Souli:
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. Oper. Res. Lett. 48(3): 240-244 (2020) - [j74]Adam N. Letchford, Georgia Souli:
Lifting the knapsack cover inequalities for the knapsack polytope. Oper. Res. Lett. 48(5): 607-611 (2020)
2010 – 2019
- 2019
- [j73]Adam N. Letchford, Juan José Salazar González:
The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time. Eur. J. Oper. Res. 272(1): 24-31 (2019) - [j72]Adam N. Letchford, Georgia Souli:
On lifted cover inequalities: A new lifting procedure with unusual properties. Oper. Res. Lett. 47(2): 83-87 (2019) - [j71]Adam N. Letchford, Georgia Souli:
New valid inequalities for the fixed-charge and single-node flow polytopes. Oper. Res. Lett. 47(5): 353-357 (2019) - 2018
- [j70]Jamie Fairbrother, Adam N. Letchford, Keith Briggs:
A two-level graph partitioning problem arising in mobile wireless communications. Comput. Optim. Appl. 69(3): 653-676 (2018) - [j69]Laura Galli, Adam N. Letchford, Sebastian J. Miller:
New valid inequalities and facets for the Simple Plant Location Problem. Eur. J. Oper. Res. 269(3): 824-833 (2018) - [j68]Konstantinos Kaparis, Adam N. Letchford:
A note on the 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 46(4): 443-447 (2018) - [j67]Laura Galli, Adam N. Letchford:
A binarisation heuristic for non-convex quadratic programming with box constraints. Oper. Res. Lett. 46(5): 529-533 (2018) - [j66]Adam N. Letchford, Andrew J. Parkes:
A guide to conic optimisation and its applications. RAIRO Oper. Res. 52(4): 1087-1106 (2018) - [c10]Adam N. Letchford, Qiang Ni, Zhaoyu Zhong:
A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints. ISCO 2018: 303-312 - [i4]James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford:
Adaptive Policies for Perimeter Surveillance Problems. CoRR abs/1810.02176 (2018) - 2017
- [j65]Adam N. Letchford, Qiang Ni, Zhaoyu Zhong:
An exact algorithm for a resource allocation problem in mobile wireless communications. Comput. Optim. Appl. 68(2): 193-208 (2017) - [j64]Laura Galli, Adam N. Letchford:
On the Lovász theta function and some variants. Discret. Optim. 25: 159-174 (2017) - [j63]Jamie Fairbrother, Adam N. Letchford:
Projection results for the -partition problem. Discret. Optim. 26: 97-111 (2017) - [j62]Adam N. Letchford, Daniel John Grainger:
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs. Oper. Res. Lett. 45(6): 631-634 (2017) - [i3]Jamie Fairbrother, Adam N. Letchford, Keith Briggs:
A Two-Level Graph Partitioning Problem Arising in Mobile Wireless Communications. CoRR abs/1705.08773 (2017) - 2016
- [j61]Adam N. Letchford, Juan José Salazar González:
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. Eur. J. Oper. Res. 251(1): 74-84 (2016) - [c9]Adam N. Letchford, Francesca Marzi, Fabrizio Rossi, Stefano Smriglio:
Strengthening Chvátal-Gomory Cuts for the Stable Set Problem. ISCO 2016: 201-212 - 2015
- [j60]Adam N. Letchford, Juan José Salazar González:
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem. Eur. J. Oper. Res. 244(3): 730-738 (2015) - [j59]Adam N. Letchford, Saeideh D. Nasiri:
The Steiner travelling salesman problem with correlated costs. Eur. J. Oper. Res. 245(1): 62-69 (2015) - [j58]Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer:
The 2013 Newton Institute Programme on polynomial optimization. Math. Program. 151(2): 375-377 (2015) - [j57]Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford:
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. Math. Program. 151(2): 639-658 (2015) - [j56]Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms. SIAM J. Optim. 25(3): 1944-1963 (2015) - 2014
- [j55]Adam N. Letchford, Saeideh D. Nasiri, Amar Oukil:
Pricing routines for vehicle routing with time windows on road networks. Comput. Oper. Res. 51: 331-337 (2014) - [j54]Adam N. Letchford, Michael Malmros Sørensen:
A new separation algorithm for the Boolean quadric and cut polytopes. Discret. Optim. 14: 61-71 (2014) - [j53]Adam N. Letchford, Sebastian J. Miller:
An aggressive reduction scheme for the simple plant location problem. Eur. J. Oper. Res. 234(3): 674-682 (2014) - [j52]Franklin Djeumou Fomeni, Adam N. Letchford:
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem. INFORMS J. Comput. 26(1): 173-182 (2014) - [j51]Samuel Burer, Adam N. Letchford:
Unbounded convex sets for non-convex mixed-integer quadratic programming. Math. Program. 143(1-2): 231-256 (2014) - [j50]Laura Galli, Adam N. Letchford:
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs. Optim. Lett. 8(4): 1213-1224 (2014) - [j49]Iskander Aliev, Adam N. Letchford:
Iterated Chvátal-Gomory Cuts and the Geometry of Numbers. SIAM J. Optim. 24(3): 1294-1312 (2014) - 2013
- [j48]Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
Approximating the Lovász θ Function with the Subgradient Method. Electron. Notes Discret. Math. 41: 157-164 (2013) - [j47]Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis:
Compact formulations of the Steiner Traveling Salesman Problem and related problems. Eur. J. Oper. Res. 228(1): 83-92 (2013) - [j46]André Renato Sales Amaral, Adam N. Letchford:
A polyhedral approach to the single row facility layout problem. Math. Program. 141(1-2): 453-477 (2013) - 2012
- [j45]Adam N. Letchford, Sebastian J. Miller:
Fast bounding procedures for large instances of the Simple Plant Location Problem. Comput. Oper. Res. 39(5): 985-990 (2012) - [j44]Adam N. Letchford, Michael Malmros Sørensen:
Binary positive semidefinite matrices and associated integer polytopes. Math. Program. 131(1-2): 253-271 (2012) - [j43]Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Complexity results for the gap inequalities for the max-cut problem. Oper. Res. Lett. 40(3): 149-152 (2012) - [c8]Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. ISCO 2012: 178-188 - [i2]Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis:
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems. CoRR abs/1203.3854 (2012) - 2011
- [j42]Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS J. Comput. 23(1): 26-40 (2011) - [j41]Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger:
Computing compatible tours for the symmetric traveling salesman problem. Math. Program. Comput. 3(1): 59-78 (2011) - [j40]Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González:
Generalized network design polyhedra. Networks 58(2): 125-136 (2011) - [j39]Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39(5): 297-300 (2011) - [j38]Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz:
On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39(5): 301-304 (2011) - [c7]Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
A New Approach to the Stable Set Problem Based on Ellipsoids. IPCO 2011: 223-234 - 2010
- [j37]Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
Lower Bounds for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 36: 843-849 (2010) - [j36]Konstantinos Kaparis, Adam N. Letchford:
Separation algorithms for 0-1 knapsack polytopes. Math. Program. 124(1-2): 69-91 (2010) - [j35]Alberto Caprara, Adam N. Letchford:
New techniques for cost sharing in combinatorial optimization games. Math. Program. 124(1-2): 93-118 (2010) - [j34]Laura Galli, Adam N. Letchford:
Small bipartite subgraph polytopes. Oper. Res. Lett. 38(5): 337-340 (2010) - [c6]Adam N. Letchford:
Integer Quadratic Quasi-polyhedra. IPCO 2010: 258-270
2000 – 2009
- 2009
- [j33]Adam N. Letchford, Amar Oukil:
Exploiting sparsity in pricing routines for the capacitated arc routing problem. Comput. Oper. Res. 36(7): 2320-2327 (2009) - [j32]Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
An application of the Lovász-Schrijver M(K, K) operator to the stable set problem. Math. Program. 120(2): 381-401 (2009) - [j31]Samuel Burer, Adam N. Letchford:
On Nonconvex Quadratic Programming with Box Constraints. SIAM J. Optim. 20(2): 1073-1089 (2009) - [r1]Richard W. Eglese, Adam N. Letchford:
General Routing Problem. Encyclopedia of Optimization 2009: 1252-1254 - 2008
- [j30]Adam N. Letchford, Nicholas A. Pearson:
Good triangulations yield good tours. Comput. Oper. Res. 35(2): 638-647 (2008) - [j29]Alistair R. Clark, Richard W. Eglese, Adam N. Letchford, Michael B. Wright:
Preface. Discret. Appl. Math. 156(3): 289-290 (2008) - [j28]Adam N. Letchford, Nicholas A. Pearson:
Exploiting planarity in separation routines for the symmetric traveling salesman problem. Discret. Optim. 5(2): 220-230 (2008) - [j27]André Renato Sales Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
A New Lower Bound for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 30: 87-92 (2008) - [j26]Konstantinos Kaparis, Adam N. Letchford:
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 186(1): 91-103 (2008) - [j25]Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis:
Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math. 22(4): 1480-1487 (2008) - [c5]Adam N. Letchford, Michael Malmros Sørensen:
Binary Positive Semidefinite Matrices and Associated Integer Polytopes. IPCO 2008: 125-139 - 2007
- [j24]Adam N. Letchford, Andrea Lodi:
The traveling salesman problem: a book review. 4OR 5(4): 315-317 (2007) - [j23]Jon Lee, Adam N. Letchford:
Mixed integer programming. Discret. Optim. 4(1): 1-2 (2007) - [j22]Adam N. Letchford, Jens Lysgaard, Richard W. Eglese:
A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Oper. Res. Soc. 58(12): 1642-1651 (2007) - 2006
- [j21]Lisa Fleischer, Adam N. Letchford, Andrea Lodi:
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. 31(4): 696-713 (2006) - [j20]Adam N. Letchford, Juan José Salazar González:
Projection results for vehicle routing. Math. Program. 105(2-3): 251-274 (2006) - [j19]Monia Giandomenico, Adam N. Letchford:
Exploring the Relationship Between Max-Cut and Stable Set Relaxations. Math. Program. 106(1): 159-175 (2006) - [i1]Adam N. Letchford, Dirk Oliver Theis:
Odd minimum cut sets and b-matchings revisited. CoRR abs/math/0607088 (2006) - 2005
- [j18]Adam N. Letchford, Nicholas A. Pearson:
A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Oper. Res. Lett. 33(6): 625-628 (2005) - 2004
- [j17]Jens Lysgaard, Adam N. Letchford, Richard W. Eglese:
A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2): 423-445 (2004) - [j16]Adam N. Letchford:
Book review. Oper. Res. Lett. 32(4): 393-394 (2004) - [c4]Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis:
A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO 2004: 196-205 - 2003
- [j15]Adam N. Letchford, Andrea Lodi:
Primal separation algorithms. 4OR 1(3): 209-224 (2003) - [j14]Alberto Caprara, Adam N. Letchford:
On the separation of split cuts and related inequalities. Math. Program. 94(2-3): 279-294 (2003) - [j13]Adam N. Letchford:
Binary clutter inequalities for integer programs. Math. Program. 98(1-3): 201-221 (2003) - 2002
- [j12]Adam N. Letchford:
Approximation Algorithms. J. Oper. Res. Soc. 53(7): 807-808 (2002) - [j11]Adam N. Letchford, Andrea Lodi:
Primal cutting plane algorithms revisited. Math. Methods Oper. Res. 56(1): 67-81 (2002) - [j10]Adam N. Letchford, Richard W. Eglese, Jens Lysgaard:
Multistars, partial multistars and the capacitated vehicle routing problem. Math. Program. 94(1): 21-40 (2002) - [j9]Adam N. Letchford:
Totally tight Chvátal-Gomory cuts. Oper. Res. Lett. 30(2): 71-73 (2002) - [j8]Adam N. Letchford, Andrea Lodi:
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2): 74-82 (2002) - [c3]Adam N. Letchford, Andrea Lodi:
Polynomial-Time Separation of Simple Comb Inequalities. IPCO 2002: 93-108 - 2001
- [j7]Adam N. Letchford, André Renato Sales Amaral:
Analysis of upper bounds for the Pallet Loading Problem. Eur. J. Oper. Res. 132(3): 582-593 (2001) - [j6]Adam N. Letchford:
On Disjunctive Cuts for Combinatorial Optimization. J. Comb. Optim. 5(3): 299-315 (2001) - [j5]Angel Corberán, Adam N. Letchford, José María Sanchis:
A cutting plane algorithm for the General Routing Problem. Math. Program. 90(2): 291-316 (2001) - [c2]Adam N. Letchford, Andrea Lodi:
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. Combinatorial Optimization 2001: 119-133 - 2000
- [j4]Adam N. Letchford:
Separating a Superclass of Comb Inequalities in Planar Graphs. Math. Oper. Res. 25(3): 443-454 (2000) - [j3]Alberto Caprara, Matteo Fischetti, Adam N. Letchford:
On the separation of maximally violated mod- k cuts. Math. Program. 87(1): 37-56 (2000)
1990 – 1999
- 1999
- [j2]Adam N. Letchford:
The general routing polyhedron: A unifying framework. Eur. J. Oper. Res. 112(1): 122-133 (1999) - [c1]Alberto Caprara, Matteo Fischetti, Adam N. Letchford:
On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98 - 1998
- [j1]Adam N. Letchford, Richard W. Eglese:
The rural postman problem with deadline classes. Eur. J. Oper. Res. 105(3): 390-400 (1998)
Coauthor Index
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-07 21:21 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:
