default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernard Gendron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j85]David Pinzon Ulloa
, Emma Frejinger, Bernard Gendron:
A logistics provider's profit maximization facility location problem with random utility maximizing followers. Comput. Oper. Res. 167: 106649 (2024)- [j84]Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches. Discret. Appl. Math. 343: 191-207 (2024) - [j83]Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi:
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning. INFORMS J. Comput. 36(1): 203-223 (2024) - 2023
- [j82]Steven Lamontagne, Margarida Carvalho, Emma Frejinger, Bernard Gendron, Miguel F. Anjos, Ribal Atallah:
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models. INFORMS J. Comput. 35(5): 1195-1213 (2023) - [j81]Robin Legault, Jean-François Côté, Bernard Gendron:
A novel reformulation for the single-sink fixed-charge transportation problem. Math. Program. 202(1): 169-198 (2023) - [j80]Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Two-stage stochastic one-to-many driver matching for ridesharing. Networks 82(4): 414-436 (2023) - 2022
- [j79]Anis Kadri, Oumar Koné, Bernard Gendron:
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements. Comput. Oper. Res. 142: 105720 (2022) - [j78]Meritxell Pacheco Paneque, Bernard Gendron, Shadi Sharif Azadeh, Michel Bierlaire:
A Lagrangian decomposition scheme for choice-based optimization. Comput. Oper. Res. 148: 105985 (2022) - [j77]Mohammad Rahim Akhavan Kazemzadeh, Tolga Bektas, Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. Discret. Appl. Math. 308: 255-275 (2022) - [j76]Christine Tawfik, Bernard Gendron, Sabine Limbourg:
An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model. Eur. J. Oper. Res. 300(2): 512-526 (2022) - [j75]Teodor Gabriel Crainic, Bernard Gendron, Mohammad Rahim Akhavan Kazemzadeh:
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications. Eur. J. Oper. Res. 303(1): 1-13 (2022) - [j74]Quang Minh Bui, Bernard Gendron, Margarida Carvalho:
A Catalog of Formulations for the Network Pricing Problem. INFORMS J. Comput. 34(5): 2658-2674 (2022) - [j73]Olivier Lalonde, Jean-François Côté, Bernard Gendron:
A Branch-and-Price Algorithm for the Multiple Knapsack Problem. INFORMS J. Comput. 34(6): 3134-3150 (2022) - [i5]Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi:
Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning. CoRR abs/2205.00897 (2022) - 2021
- [j72]Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti, Bernard Gendron, Maria Grazia Scutellà:
Optimal Access Point Power Management for Green IEEE 802.11 Networks. Sensors 21(6): 2076 (2021) - [i4]Quang Minh Bui, Bernard Gendron, Margarida Carvalho:
A Catalog of Formulations for the Network Pricing Problem. CoRR abs/2106.03887 (2021) - 2020
- [j71]Janniele A. S. Araujo, Haroldo G. Santos, Bernard Gendron, Sanjay Dominik Jena, Samuel S. Brito, Danilo S. Souza:
Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. Comput. Oper. Res. 113 (2020) - [j70]Miguel F. Anjos, Bernard Gendron, Martim Joyce-Moniz:
Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel. Eur. J. Oper. Res. 285(1): 263-278 (2020) - [j69]Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic:
The selective traveling salesman problem with draft limits. J. Heuristics 26(3): 339-352 (2020) - [j68]Ahmed Khassiba, Fabian Bastin, Sonia Cafieri, Bernard Gendron, Marcel Mongeau:
Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management. Transp. Sci. 54(4): 897-919 (2020) - [j67]Bruno Albert Neumann-Saavedra, Teodor Gabriel Crainic, Bernard Gendron, Dirk Christian Mattfeld, Michael Römer:
Integrating Resource Management in Service Network Design for Bike-Sharing Systems. Transp. Sci. 54(5): 1251-1271 (2020) - [c11]Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti, Bernard Gendron, Maria Grazia Scutellà:
Energy-efficient resource allocation in wireless LANs under non-linear capacity constraints. CAMAD 2020: 1-6 - [c10]Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. ISCO 2020: 193-201 - [c9]Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. ISCO 2020: 227-236 - [e1]Mourad Baïou, Bernard Gendron, Oktay Günlük, Ali Ridha Mahjoub:
Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12176, Springer 2020, ISBN 978-3-030-53261-1 [contents]
2010 – 2019
- 2019
- [j66]Vinicius Morais, Bernard Gendron, Geraldo Robson Mateus:
The p-arborescence star problem: Formulations and exact solution approaches. Comput. Oper. Res. 102: 91-101 (2019) - [j65]Yves Crama, Bernard Gendron, Bernard Ries:
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. Discret. Appl. Math. 261: 1 (2019) - [j64]Bernard Gendron:
Revisiting Lagrangian relaxation for network design. Discret. Appl. Math. 261: 203-218 (2019) - [i3]Janniele A. S. Araujo, Haroldo Gambini Santos, Bernard Gendron, Sanjay Dominik Jena, Samuel S. Brito, Danilo S. Souza:
Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes. CoRR abs/1909.02737 (2019) - 2018
- [j63]Maria I. Restrepo, Bernard Gendron, Louis-Martin Rousseau:
Combining Benders decomposition and column generation for multi-activity tour scheduling. Comput. Oper. Res. 93: 151-165 (2018) - [j62]Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron:
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design. EURO J. Comput. Optim. 6(2): 143-184 (2018) - [j61]Bernard Gendron, Saïd Hanafi, Raca Todosijevic:
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. Eur. J. Oper. Res. 268(1): 70-81 (2018) - [j60]Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Dynamic smoothness parameter for fast gradient methods. Optim. Lett. 12(1): 43-53 (2018) - 2017
- [j59]Raca Todosijevic, Saïd Hanafi, Dragan Urosevic, Bassem Jarboui, Bernard Gendron:
A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78: 468-479 (2017) - [j58]Amine Amrouss, Nizar El Hachemi, Michel Gendreau, Bernard Gendron:
Real-time management of transportation disruptions in forestry. Comput. Oper. Res. 83: 95-105 (2017) - [j57]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints. Comput. Oper. Res. 86: 86-93 (2017) - [j56]Maria I. Restrepo, Bernard Gendron, Louis-Martin Rousseau:
A two-stage stochastic programming approach for multi-activity tour scheduling. Eur. J. Oper. Res. 262(2): 620-635 (2017) - [j55]Rosario Giuseppe Garroppo, Bernard Gendron, Gianfranco Nencioni, Luca Tavanti:
Energy efficiency and traffic offloading in wireless mesh networks with delay bounds. Int. J. Commun. Syst. 30(2) (2017) - [j54]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities. INFORMS J. Comput. 29(3): 388-404 (2017) - [j53]Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds. Math. Program. Comput. 9(4): 573-604 (2017) - [j52]Raca Todosijevic, Anis Mjirda, Marko Mladenovic, Saïd Hanafi, Bernard Gendron:
A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11(6): 1047-1056 (2017) - [j51]Bernard Gendron, Luis Eduardo Neves Gouveia:
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems. Transp. Sci. 51(2): 629-649 (2017) - [j50]Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron:
Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design. Transp. Sci. 51(2): 650-667 (2017) - 2016
- [j49]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Solving a dynamic facility location problem with partial closing and reopening. Comput. Oper. Res. 67: 143-154 (2016) - [j48]Bernard Gendron, Maria Grazia Scutellà, Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti:
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks. Eur. J. Oper. Res. 255(1): 151-162 (2016) - [j47]Maria I. Restrepo, Bernard Gendron, Louis-Martin Rousseau:
Branch-and-Price for Personalized Multiactivity Tour Scheduling. INFORMS J. Comput. 28(2): 334-350 (2016) - [j46]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints. Transp. Sci. 50(4): 1286-1299 (2016) - [c8]Mohammed El Amrani, Youssef Benadada, Bernard Gendron:
Generalization of capacitated p-median location problem: Modeling and resolution. GOL 2016: 1-6 - [c7]Yahya Hamada, Youssef Benadada, Bernard Gendron:
Strategic planning problem represented by a three-echelon logistics network-modeling and solving. GOL 2016: 1-6 - [c6]Bruno Albert Neumann-Saavedra, Teodor Gabriel Crainic, Bernard Gendron, Dirk Christian Mattfeld, Michael Römer:
Service Network Design of Bike Sharing Systems with Resource Constraints. ICCL 2016: 352-366 - [c5]Bernard Gendron, Louis-Martin Rousseau:
Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems. ISAIM 2016 - 2015
- [j45]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Modeling and solving a logging camp location problem. Ann. Oper. Res. 232(1): 151-177 (2015) - [j44]Babacar Thiongane, Jean-François Cordeau, Bernard Gendron:
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem. Comput. Oper. Res. 53: 1-8 (2015) - [j43]Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron:
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65(4): 329-343 (2015) - [j42]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment. Networks 66(3): 214-234 (2015) - [j41]Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron:
Dynamic Facility Location with Generalized Modular Capacities. Transp. Sci. 49(3): 484-499 (2015) - 2014
- [j40]Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti, Bernard Gendron:
The greening potential of content delivery in residential community networks. Comput. Networks 73: 256-267 (2014) - [j39]Bernard Gendron, Mathieu Larose:
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. EURO J. Comput. Optim. 2(1-2): 55-75 (2014) - [j38]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. J. Heuristics 20(1): 1-38 (2014) - [j37]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. INFORMS J. Comput. 26(1): 88-102 (2014) - [j36]Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26(4): 645-657 (2014) - [j35]Vincent Boyer, Bernard Gendron, Louis-Martin Rousseau:
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. J. Sched. 17(2): 185-197 (2014) - [c4]Rosario Giuseppe Garroppo, Gianfranco Nencioni, Gregorio Procissi, Luca Tavanti, Bernard Gendron:
Energy efficiency and traffic offloading in WLANs with caching and mesh capabilities. ITC 2014: 1-6 - 2013
- [j34]Stefan Gollowitzer, Bernard Gendron, Ivana Ljubic:
A cutting plane algorithm for the Capacitated Connected Facility Location Problem. Comput. Optim. Appl. 55(3): 647-674 (2013) - [j33]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
A computational comparison of flow formulations for the capacitated location-routing problem. Discret. Optim. 10(4): 263-295 (2013) - [j32]Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. Electron. Notes Discret. Math. 41: 173-180 (2013) - [j31]Bernard Gendron, Rosario Giuseppe Garroppo, Gianfranco Nencioni, Maria Grazia Scutellà, Luca Tavanti:
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks. Electron. Notes Discret. Math. 41: 367-374 (2013) - [j30]Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling. INFORMS J. Comput. 25(3): 461-474 (2013) - [j29]Antonio Frangioni, Bernard Gendron:
A stabilized structured Dantzig-Wolfe decomposition method. Math. Program. 140(1): 45-76 (2013) - 2012
- [j28]Patrick St-Louis, Bernard Gendron, Alain Hertz:
Total domination and the Caccetta-Häggkvist conjecture. Discret. Optim. 9(4): 236-240 (2012) - 2011
- [j27]Marie-Claude Côté, Bernard Gendron, Claude-Guy Quimper, Louis-Martin Rousseau:
Formal languages for integer programming modeling of shift scheduling problems. Constraints An Int. J. 16(1): 54-76 (2011) - [j26]Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling. Manag. Sci. 57(1): 151-163 (2011) - 2010
- [j25]Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:
Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling. Electron. Notes Discret. Math. 36: 727-734 (2010)
2000 – 2009
- 2009
- [j24]Alysson M. Costa, Jean-François Cordeau, Bernard Gendron:
Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42(3): 371-392 (2009) - [j23]Bernard Gendron, Frédéric Semet:
Formulations and relaxations for a multi-echelon capacitated location-distribution problem. Comput. Oper. Res. 36(5): 1335-1355 (2009) - [j22]Gilles Pesant, Meinolf Sellmann, Bernard Gendron:
Special issue on constraint programming. Comput. Oper. Res. 36(8): 2329 (2009) - [j21]Antonio Frangioni, Bernard Gendron:
0-1 reformulations of the multicommodity capacitated network design problem. Discret. Appl. Math. 157(6): 1229-1241 (2009) - [i2]Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:
Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling. Models and Algorithms for Optimization in Logistics 2009 - [i1]Bernard Gendron, Paul-Virak Khuong, Frédéric Semet:
Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j20]Bernard Gendron, Alain Hertz, Patrick St-Louis:
A sequential elimination algorithm for computing bounds on the clique number of a graph. Discret. Optim. 5(3): 615-628 (2008) - [j19]Maurício C. de Souza, Philippe Mahey, Bernard Gendron:
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. Networks 51(2): 133-141 (2008) - [j18]Bernard Gendron, Alain Hertz, Patrick St-Louis:
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem. Oper. Res. Lett. 36(3): 345-350 (2008) - 2007
- [j17]Bernard Gendron:
A Word from the Editor. INFOR Inf. Syst. Oper. Res. 45(1): 1-3 (2007) - [j16]Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti:
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. Oper. Res. 55(1): 146-157 (2007) - [j15]Bernard Gendron, Alain Hertz, Patrick St-Louis:
On edge orienting methods for graph coloring. J. Comb. Optim. 13(2): 163-178 (2007) - [c3]Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau:
Modeling the Regular Constraint with Integer Programming. CPAIOR 2007: 29-43 - 2006
- [c2]Michel Gendreau, Jacques A. Ferland, Bernard Gendron, Noureddine Hail, Brigitte Jaumard, Sophie D. Lapierre, Gilles Pesant, Patrick Soriano:
Physician Scheduling in Emergency Rooms. PATAT 2006: 53-66 - 2005
- [j14]Bernard Gendron:
Scheduling Employees in Quebec's Liquor Stores with Integer Programming. Interfaces 35(5): 402-410 (2005) - [c1]Bernard Gendron, Hocine Lebbah, Gilles Pesant:
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. CPAIOR 2005: 217-227 - 2004
- [j13]Teodor Gabriel Crainic, Bernard Gendron, Geneviève Hernu:
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design. J. Heuristics 10(5): 525-545 (2004) - 2003
- [j12]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. Ann. Oper. Res. 122(1-4): 193-217 (2003) - [j11]Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti:
A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems. Manag. Sci. 49(9): 1268-1273 (2003) - [j10]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements. Parallel Comput. 29(5): 591-606 (2003) - [j9]Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti:
Models and Methods for Merge - in - Transit Operations. Transp. Sci. 37(1): 1-22 (2003) - [j8]John-Paul Clarke, Bernard Gendron:
Foreword to the Special Issue on Aviation Operations Research: Commemorating 100 Years of Aviation. Transp. Sci. 37(4): 365 (2003) - 2002
- [j7]Bernard Gendron:
A note on "a dual-ascent approach to the fixed-charge capacitated network design problem". Eur. J. Oper. Res. 138(3): 671-675 (2002) - [j6]Bernard Gendron, Jean-Yves Potvin, Patrick Soriano:
Diversification strategies in local search for a nonbifurcated network loading problem. Eur. J. Oper. Res. 142(2): 231-241 (2002) - 2001
- [j5]Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron:
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discret. Appl. Math. 112(1-3): 73-99 (2001) - 2000
- [j4]David Berger, Bernard Gendron, Jean-Yves Potvin, S. Raghavan, Patrick Soriano:
Tabu Search for a Network Loading Problem with Multiple Facilities. J. Heuristics 6(2): 253-267 (2000) - [j3]Benoît Bourbeau, Teodor Gabriel Crainic, Bernard Gendron:
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Comput. 26(1): 27-46 (2000)
1990 – 1999
- 1997
- [j2]Bernard Gendron, Teodor Gabriel Crainic:
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Comput. Oper. Res. 24(9): 829-847 (1997) - 1994
- [j1]Bernard Gendron, Teodor Gabriel Crainic:
Parallel Branch-and-Branch Algorithms: Survey and Synthesis. Oper. Res. 42(6): 1042-1066 (1994)
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:24 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:
