default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas A. Feo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j17]Mauricio G. C. Resende, Thomas A. Feo, Stuart H. Smith:
Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP. ACM Trans. Math. Softw. 24(4): 386-394 (1998)- 1996
- [j16]Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt:
Randomized methods for the number partitioning problem. Comput. Oper. Res. 23(2): 103-111 (1996) - [j15]Thomas A. Feo, Kishore Sarathy, John McGahan:
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput. Oper. Res. 23(9): 881-895 (1996) - [j14]Manoj K. Chari, Thomas A. Feo, J. Scott Provan:
The Delta-Wye Approximation Procedure for Two-Terminal Reliability. Oper. Res. 44(5): 745-757 (1996) - 1995
- [j13]Thomas A. Feo, Jonathan F. Bard, Scott D. Holland:
Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly. Oper. Res. 43(2): 219-230 (1995) - [j12]Thomas A. Feo, Mauricio G. C. Resende:
Greedy Randomized Adaptive Search Procedures. J. Glob. Optim. 6(2): 109-133 (1995) - [j11]Thomas A. Feo, José Luis González Velarde:
The Intermodal Trailer Assignment Problem. Transp. Sci. 29(4): 330-341 (1995) - 1994
- [j10]Manuel Laguna, Thomas A. Feo, Hal C. Elrod:
A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem. Oper. Res. 42(4): 677-687 (1994) - [j9]Thomas A. Feo, Mauricio G. C. Resende, Stuart H. Smith:
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Oper. Res. 42(5): 860-878 (1994) - 1993
- [j8]Thomas A. Feo, J. Scott Provan:
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs. Oper. Res. 41(3): 572-582 (1993) - [j7]Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo:
Single machine scheduling with flow time and earliness penalties. J. Glob. Optim. 3(3): 289-309 (1993) - [c1]Mauricio G. C. Resende, Thomas A. Feo:
A GRASP for satisfiability. Cliques, Coloring, and Satisfiability 1993: 499-520 - 1992
- [j6]Thomas A. Feo, Olivier Goldschmidt, Mallek Khellaf:
One-Half Approximation Algorithms for the k-Partition Problem. Oper. Res. 40(Supplement-1): S170-S173 (1992) - 1991
- [j5]Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard:
A GRASPTM for a difficult single machine scheduling problem, . Comput. Oper. Res. 18(8): 635-643 (1991) - 1990
- [j4]Thomas A. Feo, Mallek Khellaf:
A class of bounded approximation algorithms for graph partitioning. Networks 20(2): 181-195 (1990) - [j3]Rubin Johnson, Thomas A. Feo, Bruce W. Lamar, Peter B. Belobaba, David A. Hensher, Robert A. Wolfe, Susan Hanson, Ilan Solomon:
Bibliographic Section. Transp. Sci. 24(2): 159-167 (1990)
1980 – 1989
- 1988
- [j2]Peter R. White, Kenneth E. Train, Hani S. Mahmassani, Thomas A. Feo:
Bibliographic Section. Transp. Sci. 22(3): 226-230 (1988) - 1986
- [j1]Thomas A. Feo, Dorit S. Hochbaum:
OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing. Oper. Res. 34(6): 819-831 (1986)
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-25 05:58 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:
