default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald W. Hearn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j14]Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich:
A heuristic method for the minimum toll booth problem. J. Glob. Optim. 48(4): 533-548 (2010)
2000 – 2009
- 2009
- [r2]Donald W. Hearn, Timothy J. Lowe:
Lagrangian Duality: BASICS. Encyclopedia of Optimization 2009: 1805-1813 - [r1]Donald W. Hearn:
Single Facility Location: Circle Covering Problem. Encyclopedia of Optimization 2009: 3607-3610 - 2004
- [j13]Siriphong Lawphongpanich, Donald W. Hearn:
An MPEC approach to second-best toll pricing. Math. Program. 101(1): 33-55 (2004) - [j12]Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich:
Decomposition techniques for the minimum toll revenue problem. Networks 44(2): 142-150 (2004) - 2001
- [j11]Leonidas S. Pitsoulis, Panos M. Pardalos, Donald W. Hearn:
Approximate solutions to the turbine balancing problem. Eur. J. Oper. Res. 130(1): 147-155 (2001)
1990 – 1999
- 1997
- [j10]Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos, Motakuri V. Ramana:
Continuous Characterizations of the Maximum Clique Problem. Math. Oper. Res. 22(3): 754-768 (1997) - 1995
- [j9]Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee:
Minimizing the error bound for the dynamic lot size model. Oper. Res. Lett. 17(2): 57-68 (1995) - 1994
- [j8]Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee:
A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J. Glob. Optim. 4(3): 285-300 (1994) - [j7]Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee:
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs. J. Glob. Optim. 4(4): 397-413 (1994) - 1993
- [j6]William W. Hager, Donald W. Hearn:
Application of the dual active set algorithm to quadratic network optimization. Comput. Optim. Appl. 1(4): 349-373 (1993) - [j5]José A. Ventura, Donald W. Hearn:
Restricted simplicial decomposition for convex constrained problems. Math. Program. 59: 71-85 (1993) - [c2]Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos:
A continuous based heuristic for the maximum clique problem. Cliques, Coloring, and Satisfiability 1993: 103-124 - 1990
- [j4]Siriphong Lawphongpanich, Donald W. Hearn:
Benders Decomposition for Variational Inequalities. Math. Program. 48: 231-247 (1990)
1980 – 1989
- 1982
- [j3]Donald W. Hearn, James Vijay:
Efficient Algorithms for the (Weighted) Minimum Circle Problem. Oper. Res. 30(4): 777-795 (1982) - [j2]Donald W. Hearn:
The gap function of a convex program. Oper. Res. Lett. 1(2): 67-71 (1982)
1970 – 1979
- 1978
- [j1]Jacques A. Chatelon, Donald W. Hearn, Timothy J. Lowe:
A subgradient algorithm for certain minimax and minisum problems. Math. Program. 15(1): 130-145 (1978) - 1973
- [c1]Donald W. Hearn, William D. Randolph:
Computational aspects of a Dual algorithm for quadratically constrained quadratic programs. ACM Annual Conference 1973: 48-51
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-04-24 23:16 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:
