default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanif D. Sherali
- > Home > Persons > Hanif D. Sherali
Publications
- 2022
[j228]Maichel M. Aguayo, Francisco N. Avilés, Subhash C. Sarin, Hanif D. Sherali:
A Two-Index Formulation for the Fixed-Destination Multi-Depot Asymmetric Travelling Salesman Problem and Some Extensions. Informatica 33(4): 671-692 (2022)- 2018
- [j224]Maichel M. Aguayo
, Subhash C. Sarin, Hanif D. Sherali:
Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions. J. Oper. Res. Soc. 69(5): 734-746 (2018) - 2016
- [j220]Evrim Dalkiran, Hanif D. Sherali:
RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems. Math. Program. Comput. 8(3): 337-375 (2016) - 2015
- [j211]Warren P. Adams, Hanif D. Sherali:
RLT insights into lift-and-project closures. Optim. Lett. 9(1): 19-39 (2015) - 2014
- [j208]Subhash C. Sarin, Hanif D. Sherali, Jason D. Judd, Pei-Fang Jennifer Tsai:
Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations. Comput. Oper. Res. 51: 64-89 (2014) - [j205]Douglas R. Bish, Hanif D. Sherali, Antoine G. Hobeika:
Optimal evacuation planning using staging and routing. J. Oper. Res. Soc. 65(1): 124-140 (2014) - [j203]Subhash C. Sarin, Hanif D. Sherali, Lingrui Liao:
Minimizing conditional-value-at-risk for stochastic scheduling problems. J. Sched. 17(1): 5-15 (2014) - 2013
- [j201]Hanif D. Sherali, Justin M. Hill:
Configuration of airspace sectors for balancing air traffic controller workload. Ann. Oper. Res. 203(1): 3-31 (2013) - [j200]Hanif D. Sherali, Brian J. Lunday:
On generating maximal nondominated Benders cuts. Ann. Oper. Res. 210(1): 57-72 (2013) - [j197]Douglas R. Bish, Hanif D. Sherali:
Aggregate-level demand management in evacuation planning. Eur. J. Oper. Res. 224(1): 79-92 (2013) - [j196]Evrim Dalkiran, Hanif D. Sherali:
Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality. J. Glob. Optim. 57(4): 1147-1172 (2013) - [j194]Frank M. Muldoon, Warren P. Adams, Hanif D. Sherali:
Ideal representations of lexicographic orderings and base-2 expansions of integer variables. Oper. Res. Lett. 41(1): 32-39 (2013) - 2012
- [j190]Brian J. Lunday, Hanif D. Sherali:
Network interdiction to minimize the maximum probability of evasion with synergy between applied resources. Ann. Oper. Res. 196(1): 411-442 (2012) - [j189]Brian J. Lunday, Hanif D. Sherali, Kevin E. Lunday:
The coastal seaspace patrol sector design and allocation problem. Comput. Manag. Sci. 9(4): 483-514 (2012) - [j188]Hanif D. Sherali, Evrim Dalkiran, Jitamitra Desai:
Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts. Comput. Optim. Appl. 52(2): 483-506 (2012) - [j185]Hanif D. Sherali, Evrim Dalkiran, Leo Liberti:
Reduced RLT representations for nonconvex polynomial programming problems. J. Glob. Optim. 52(3): 447-469 (2012) - [j184]Lingrui Liao, Subhash C. Sarin, Hanif D. Sherali:
A scenario generation-based lower bounding approach for stochastic scheduling problems. J. Oper. Res. Soc. 63(10): 1410-1420 (2012) - [j183]Brian J. Lunday, Hanif D. Sherali:
Minimizing the maximum network flow: models and algorithms with resource synergy considerations. J. Oper. Res. Soc. 63(12): 1693-1707 (2012) - [j179]Hanif D. Sherali, J. Cole Smith:
Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs. Optim. Lett. 6(1): 127-139 (2012) - 2011
- [j175]Hanif D. Sherali, Evrim Dalkiran, Theodore S. Glickman:
Selecting Optimal Alternatives and Risk Reduction Strategies in Decision Trees. Oper. Res. 59(3): 631-647 (2011) - [j174]Hanif D. Sherali, Evrim Dalkiran:
Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs. J. Glob. Optim. 51(3): 377-393 (2011) - [j169]Subhash C. Sarin, Hanif D. Sherali, Liming Yao:
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem. Optim. Lett. 5(2): 259-272 (2011) - [j167]Hanif D. Sherali, Justin M. Hill, Michael V. McCrea, Antonio A. Trani:
Integrating Slot Exchange, Safety, Capacity, and Equity Mechanisms Within an Airspace Flow Program. Transp. Sci. 45(2): 271-284 (2011) - 2010
- [j165]Churlzu Lim, Hanif D. Sherali, Stan Uryasev:
Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization. Comput. Optim. Appl. 46(3): 391-415 (2010) - [j162]Brian J. Lunday, Hanif D. Sherali:
A Dynamic Network Interdiction Problem. Informatica 21(4): 553-574 (2010) - [j160]Brian J. Lunday, Hanif D. Sherali, Theodore S. Glickman:
The Nested Event Tree Model with Application to Combating Terrorism. INFORMS J. Comput. 22(4): 620-634 (2010) - [j159]Shivaram Subramanian, Hanif D. Sherali:
A fractional programming approach for retail category price optimization. J. Glob. Optim. 48(2): 263-277 (2010) - 2009
- [j156]Hanif D. Sherali, Warren P. Adams:
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions. Discret. Appl. Math. 157(6): 1319-1333 (2009) - [j155]Hanif D. Sherali, Antoine G. Hobeika, Chawalit Jeenanunta:
An Optimal Constrained Pruning Strategy for Decision Trees. INFORMS J. Comput. 21(1): 49-61 (2009) - [j152]Xiaomei Zhu, Hanif D. Sherali:
Two-stage workforce planning under demand fluctuations and uncertainty. J. Oper. Res. Soc. 60(1): 94-103 (2009) - [j151]Hanif D. Sherali, J. Cole Smith:
Two-stage stochastic hierarchical multiple risk problems: models and algorithms. Math. Program. 120(2): 403-427 (2009) - [r1]Hanif D. Sherali, Leo Liberti:
Reformulation-Linearization Technique for Global Optimization. Encyclopedia of Optimization 2009: 3263-3268 - 2008
- [j144]Hanif D. Sherali, Fred W. Glover:
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities. Discret. Optim. 5(2): 270-289 (2008) - [j142]Shivaram Subramanian, Hanif D. Sherali:
An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems. INFORMS J. Comput. 20(4): 565-578 (2008) - [j141]Hanif D. Sherali, Xiaomei Zhu:
Two-Stage Fleet Assignment Model Considering Stochastic Passenger Demands. Oper. Res. 56(2): 383-399 (2008) - [j136]Hanif D. Sherali, Jitamitra Desai, Theodore S. Glickman:
Optimal Allocation of Risk-Reduction Resources in Event Trees. Manag. Sci. 54(7): 1313-1321 (2008) - [j135]Fred W. Glover, Hanif D. Sherali:
Second-order cover inequalities. Math. Program. 114(2): 207-234 (2008) - 2007
- [j126]Fred W. Glover, Hanif D. Sherali:
A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs. Int. J. Comput. Sci. Eng. 3(3): 203-210 (2007) - [j124]Hanif D. Sherali, Churlzu Lim:
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability. INFORMS J. Comput. 19(1): 3-13 (2007) - [j121]Hanif D. Sherali, J. Cole Smith:
An improved linearization strategy for zero-one quadratic programming problems. Optim. Lett. 1(1): 33-47 (2007) - [j119]Russell D. Meller, Weiping Chen, Hanif D. Sherali:
Applying the sequence-pair representation to optimal facility layout designs. Oper. Res. Lett. 35(5): 651-659 (2007) - 2006
- [j116]Churlzu Lim, Hanif D. Sherali:
Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods. Comput. Optim. Appl. 34(3): 409-428 (2006) - [j115]Hanif D. Sherali, Subhash C. Sarin, Pei-Fang Tsai:
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. Discret. Optim. 3(1): 20-32 (2006) - [j114]Hanif D. Sherali, Ebru K. Bish, Xiaomei Zhu:
Airline fleet assignment concepts, models, and algorithms. Eur. J. Oper. Res. 172(1): 1-30 (2006) - [j110]Churlzu Lim, Hanif D. Sherali:
A Trust Region Target Value Method for Optimizing Nondifferentiable Lagrangian Duals of Linear Programs. Math. Methods Oper. Res. 64(1): 33-53 (2006) - [j108]Suvrajeet Sen, Hanif D. Sherali:
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Program. 106(2): 203-223 (2006) - [j107]Hanif D. Sherali, J. Cole Smith:
A polyhedral study of the generalized vertex packing problem. Math. Program. 107(3): 367-390 (2006) - [j106]Hanif D. Sherali, Xiaomei Zhu:
On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables. Math. Program. 108(2-3): 597-616 (2006) - [j105]Hanif D. Sherali, Chawalit Jeenanunta, Antoine G. Hobeika:
The approach-dependent, time-dependent, label-constrained shortest path problem. Networks 48(2): 57-67 (2006) - [j103]Hanif D. Sherali, Raymond W. Staats, Antonio A. Trani:
An Airspace-Planning and Collaborative Decision-Making Model: Part II - Cost Model, Data Considerations, and Computations. Transp. Sci. 40(2): 147-164 (2006) - 2005
- [j100]Warren P. Adams, Hanif D. Sherali:
A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems. Ann. Oper. Res. 140(1): 21-47 (2005) - [j99]Fred W. Glover, Hanif D. Sherali:
Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints. Ann. Oper. Res. 140(1): 215-233 (2005) - [j98]Hanif D. Sherali, J. Cole Smith:
A class of web-based facets for the generalized vertex packing problem. Discret. Appl. Math. 146(3): 273-286 (2005) - [j97]Fred W. Glover, Hanif D. Sherali:
Chvatal-Gomory-tier cuts for general integer programs. Discret. Optim. 2(1): 51-69 (2005) - [j96]Hanif D. Sherali, J. Cole Smith:
Interleaving two-phased jobs on a single machine. Discret. Optim. 2(4): 348-361 (2005) - [j95]Hanif D. Sherali, Youngho Lee, Youngjin Kim:
Partial convexification cuts for 0-1 mixed-integer programs. Eur. J. Oper. Res. 165(3): 625-648 (2005) - [j94]Hanif D. Sherali, Jitamitra Desai:
A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem. J. Glob. Optim. 32(2): 281-306 (2005) - [j93]Hanif D. Sherali, Jitamitra Desai:
A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem. J. Glob. Optim. 33(4): 597-615 (2005) - [j91]Subhash C. Sarin, Hanif D. Sherali, Ajay Bhootra:
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper. Res. Lett. 33(1): 62-70 (2005) - [j90]Hanif D. Sherali, Ebru K. Bish, Xiaomei Zhu:
Polyhedral Analysis and Algorithms for a Demand-Driven Refleeting Model for Aircraft Assignment. Transp. Sci. 39(3): 349-366 (2005) - 2004
- [j89]Hanif D. Sherali, Churlzu Lim:
On embedding the volume algorithm in a variable target value method. Oper. Res. Lett. 32(5): 455-462 (2004) - 2003
- [j87]Hanif D. Sherali, Barbara M. P. Fraticelli, Russell D. Meller:
Enhanced Model Formulations for Optimal Facility Layout. Oper. Res. 51(4): 629-644 (2003) - [j85]Fred W. Glover, Hanif D. Sherali:
Foundation-penalty cuts for mixed-integer programs. Oper. Res. Lett. 31(3): 245-253 (2003) - [j84]Hanif D. Sherali, Antoine G. Hobeika, Sasikul Kangwalklai:
Time-Dependent, Label-Constrained Shortest Path Problems with Applications. Transp. Sci. 37(3): 278-293 (2003) - [j83]Hanif D. Sherali, Raymond W. Staats, Antonio A. Trani:
An Airspace Planning and Collaborative Decision - Making Model: Part I - Probabilistic Conflicts, Workload, and Equity Considerations. Transp. Sci. 37(4): 434-456 (2003) - 2002
- [j82]Hanif D. Sherali, Intesar Al-Loughani, Shivaram Subramanian:
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems. Oper. Res. 50(3): 433-448 (2002) - [j81]Hanif D. Sherali, Patrick J. Driscoll:
On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems. Oper. Res. 50(4): 656-669 (2002) - [j80]Hanif D. Sherali, Barbara M. P. Fraticelli:
Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22(1-4): 233-261 (2002) - [j79]Hanif D. Sherali, Barbara M. P. Fraticelli:
A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse. J. Glob. Optim. 22(1-4): 319-342 (2002) - [j78]Hanif D. Sherali, J. Cole Smith, Antonio A. Trani:
An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations. Transp. Sci. 36(4): 378-397 (2002) - 2001
- [j76]Hanif D. Sherali, Burak Özdaryal, Warren P. Adams, Naguib Attia:
On using exterior penalty approaches for solving linear programming problems. Comput. Oper. Res. 28(11): 1049-1074 (2001) - [j75]Hanif D. Sherali, J. Cole Smith, Shokri Z. Selim:
Convex hull representations of models for computing collisions between multiple bodies. Eur. J. Oper. Res. 135(3): 514-526 (2001) - [j74]Hanif D. Sherali, Shivaram Subramanian, G. V. Loganathan:
Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality. J. Glob. Optim. 19(1): 1-26 (2001) - [j73]Hanif D. Sherali, J. Cole Smith:
Improving Discrete Model Representations via Symmetry Considerations. Manag. Sci. 47(10): 1396-1407 (2001) - 2000
- [j70]Hanif D. Sherali, Jonathan Cole Smith, Warren P. Adams:
Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. Discret. Appl. Math. 101(1-3): 247-267 (2000) - [j69]Hanif D. Sherali, Youngho Lee, Taehyung Park:
New modeling approaches for the design of local access transport area networks. Eur. J. Oper. Res. 127(1): 94-108 (2000) - [j67]Hanif D. Sherali, J. Cole Smith, Youngho Lee:
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting. INFORMS J. Comput. 12(4): 284-298 (2000) - [j65]Benjamin Lev, Hanif D. Sherali, Antanas Zilinskas, Stefan Voss, Arnold Reisman:
Book Reviews. Interfaces 30(6): 107-115 (2000) - [j64]Youngho Lee, Hanif D. Sherali, Junghee Han, Seong-in Kim:
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. Networks 35(3): 223-232 (2000) - [j61]Hanif D. Sherali, J. Cole Smith, Antonio A. Trani, Srinivas Sale:
National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm. Transp. Sci. 34(4): 321-336 (2000) - 1999
- [j60]Hanif D. Sherali, Intesar Al-Loughani:
Solving Euclidean Distance Multifacility Location Problems Using Conjugate Subgradient and Line-Search Methods. Comput. Optim. Appl. 14(3): 275-291 (1999) - 1998
- [j59]Shirish S. Joshi, Hanif D. Sherali, Jeffrey D. Tew:
An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies. Comput. Oper. Res. 25(7-8): 531-541 (1998) - [j58]Hanif D. Sherali, Warren P. Adams, Patrick J. Driscoll:
Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems. Oper. Res. 46(3): 396-405 (1998) - [j56]Warren P. Adams, Julie Bowers Lassiter, Hanif D. Sherali:
Persistency in 0-1 Polynomial Programming. Math. Oper. Res. 23(2): 359-389 (1998) - [j55]Hanif D. Sherali, Kaan Özbay, Shivaram Subramanian:
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms. Networks 31(4): 259-272 (1998) - 1997
- [j53]Fred W. Glover, Hanif D. Sherali, Youngho Lee:
Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming. Comput. Optim. Appl. 8(2): 151-172 (1997) - [j49]Hanif D. Sherali, Laora D. Brizendine, Theodore S. Glickman, Shivaram Subramanian:
Low Probability - High Consequence Considerations in Routing Hazardous Material Shipments. Transp. Sci. 31(3): 237-251 (1997) - 1996
- [j48]Hanif D. Sherali, Youngho Lee:
Tighter Representations for Set Partitioning Problems. Discret. Appl. Math. 68(1-2): 153-167 (1996) - 1995
- [j43]Hanif D. Sherali, Youngho Lee, Warren P. Adams:
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope. Oper. Res. Lett. 17(1): 19-26 (1995) - [j42]Hanif D. Sherali, Youngho Lee:
Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes. SIAM J. Discret. Math. 8(1): 133-153 (1995) - 1994
- [j41]Youngho Lee, Hanif D. Sherali:
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem. Ann. Oper. Res. 50(1): 339-365 (1994) - [j40]Hanif D. Sherali, Sridhar Ramachandran, Seong-in Kim:
A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem. Discret. Appl. Math. 49(1-3): 357-378 (1994) - [j39]Hanif D. Sherali, Warren P. Adams:
A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems. Discret. Appl. Math. 52(1): 83-106 (1994) - [c2]Shirish S. Joshi, Hanif D. Sherali, Jeffrey D. Tew:
An enhanced RSM algorithm using gradient-deflection and second-order search strategies. WSC 1994: 297-304 - 1993
- [j37]Warren P. Adams, Hanif D. Sherali:
Mixed-integer bilinear programming problems. Math. Program. 59: 279-305 (1993) - 1992
- [j35]Seong-in Kim, Hanif D. Sherali, Heung-Sun Park:
Minisum and minimax paths of a moving facility on a network. Comput. Oper. Res. 19(2): 123-131 (1992) - [j32]Hanif D. Sherali, Seong-In Kim:
Variational Problems for Determining Optimal Paths of a Moving Facility. Transp. Sci. 26(4): 330-345 (1992) - 1990
- [j28]Warren P. Adams, Hanif D. Sherali:
Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems. Oper. Res. 38(2): 217-226 (1990) - [j26]Hanif D. Sherali, Warren P. Adams:
A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems. SIAM J. Discret. Math. 3(3): 411-430 (1990) - 1988
- [j25]Hanif D. Sherali, Allen L. Soyster:
Convergence analysis and algorithmic implications of two dynamic processes toward an oligopolycompetitive fringe equilibrium solution. Comput. Oper. Res. 15(1): 69-81 (1988) - 1987
- [j20]G. V. Loganathan, Hanif D. Sherali:
A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization. Oper. Res. 35(3): 365-377 (1987) - [j19]Suvrajeet Sen, Hanif D. Sherali:
Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. Math. Program. 37(2): 169-183 (1987) - 1986
- [j15]Suvrajeet Sen, Hanif D. Sherali:
Facet inequalities from simple disjunctions in cutting plane theory. Math. Program. 34(1): 72-83 (1986) - [j14]Suvrajeet Sen, Hanif D. Sherali:
A class of convergent primal-dual subgradient algorithms for decomposable convex programs. Math. Program. 35(3): 279-297 (1986) - [j13]Tom M. Cavalier, Hanif D. Sherali:
Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons. Transp. Sci. 20(2): 107-116 (1986) - 1985
- [j11]Suvrajeet Sen, Hanif D. Sherali:
A branch and bound algorithm for extreme point mathematical programming problems. Discret. Appl. Math. 11(3): 265-280 (1985) - [j10]Hanif D. Sherali, Suvrajeet Sen:
Technical Note - On Generating Cutting Planes from Combinatorial Disjunctions. Oper. Res. 33(4): 928-933 (1985) - [j9]Suvrajeet Sen, Hanif D. Sherali:
On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs. Math. Program. 31(1): 42-56 (1985) - [j8]Tom M. Cavalier, Hanif D. Sherali:
Sequential location-allocation problems on chains and trees with probabilistic link demands. Math. Program. 32(3): 249-277 (1985) - 1984
- [j6]Hanif D. Sherali, Warren P. Adams:
A Decomposition Algorithm for a Discrete Location-Allocation Problem. Oper. Res. 32(4): 878-900 (1984) - 1983
- [j5]Hanif D. Sherali, Allen L. Soyster, Frederic H. Murphy:
Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations. Oper. Res. 31(2): 253-276 (1983) - 1982
- [j3]Frederic H. Murphy, Hanif D. Sherali, Allen L. Soyster:
A mathematical programming approach for determining oligopolistic market equilibrium. Math. Program. 24(1): 92-106 (1982)
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-09-09 01:18 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:
