default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDH. Donald Ratliff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1999
[j15]Christos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman:
Minimal Connected Enclosures on an Embedded Planar Graph. Discret. Appl. Math. 91(1-3): 25-38 (1999)- 1995
- [j14]Christopher A. Hane, H. Donald Ratliff:
Sequencing inputs to multi-commodity pipelines. Ann. Oper. Res. 57(1): 73-101 (1995) - 1991
- [j13]Ananth V. Iyer, H. Donald Ratliff, Gopalakrishnan Vijayan:
On an edge ranking problem of trees and graphs. Discret. Appl. Math. 30(1): 43-52 (1991) - 1990
- [j12]Anant H. V. Lyer, John J. Jarvis, H. Donald Ratliff:
Hierarchical solution of network flow problems. Networks 20(6): 731-752 (1990) - 1988
- [j11]Ananth V. Iyer, H. Donald Ratliff, Gopalakrishnan Vijayan:
Optimal Node Ranking of Trees. Inf. Process. Lett. 28(5): 225-229 (1988) - 1983
- [j10]H. Donald Ratliff, Arnon S. Rosenthal:
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem. Oper. Res. 31(3): 507-521 (1983) - 1981
- [j9]Frank H. Cullen, John J. Jarvis, H. Donald Ratliff:
Set partitioning based heuristics for interactive routing. Networks 11(2): 125-143 (1981) - 1980
- [j8]John J. Bartholdi III, James B. Orlin, H. Donald Ratliff:
Cyclic Scheduling via Integer Programs with Circular Ones. Oper. Res. 28(5): 1074-1085 (1980) - [j7]Jean-Claude Picard, H. Donald Ratliff:
A cut approach to a class of quadratic integer programming problems. Networks 10(4): 363-370 (1980) - 1978
- [j6]Jean-Claude Picard, H. Donald Ratliff:
A Cut Approach to the Rectilinear Distance Facility Location Problem. Oper. Res. 26(3): 422-433 (1978) - [j5]Richard L. Francis, Timothy J. Lowe, H. Donald Ratliff:
Distance Constraints for Tree Network Multifacility Location Problems. Oper. Res. 26(4): 570-596 (1978) - 1975
- [j4]Jean-Claude Picard, H. Donald Ratliff:
Minimum cuts and related problems. Networks 5(4): 357-370 (1975) - 1974
- [j3]Robert C. Dorsey, Thom J. Hodgson, H. Donald Ratliff:
Technical Note - A Production-Scheduling Problem with Batch Processing. Oper. Res. 22(6): 1271-1279 (1974) - 1973
- [j2]Jean-Claude Picard, H. Donald Ratliff:
A Graph-Theoretic Equivalence for Integer Programs. Oper. Res. 21(1): 261-269 (1973) - 1972
- [j1]Peter C. Belford, H. Donald Ratliff:
A Network-Flow Model for Racially Balancing Schools. Oper. Res. 20(3): 619-628 (1972)
Conference and Workshop Papers
- 1997
- [c1]John S. Carson II, Mani S. Manivannan, Mark K. Brazier, Eric Miller, H. Donald Ratliff:
Panel on Transportation and Logistics Modeling. WSC 1997: 1244-1250
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:10 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:
