Thomas A. Feo

18 papers Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
1998 J jnl
Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.
ACM Trans. Math. Softw.
Mauricio G. C. Resende, Thomas A. Feo, Stuart H. Smith
1996 J jnl
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties.
Comput. Oper. Res.
Thomas A. Feo, Kishore Sarathy, John McGahan
1996 J jnl
Randomized methods for the number partitioning problem.
Comput. Oper. Res.
Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt
1996 J jnl
The Delta-Wye Approximation Procedure for Two-Terminal Reliability.
Oper. Res.
Manoj K. Chari, Thomas A. Feo, J. Scott Provan
1995 J jnl
Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly.
Oper. Res.
Thomas A. Feo, Jonathan F. Bard, Scott D. Holland
1995 J jnl
Greedy Randomized Adaptive Search Procedures.
J. Glob. Optim.
Thomas A. Feo, Mauricio G. C. Resende
1995 J jnl
The Intermodal Trailer Assignment Problem.
Transp. Sci.
Thomas A. Feo, José Luis González Velarde
1994 J jnl
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.
Oper. Res.
Thomas A. Feo, Mauricio G. C. Resende, Stuart H. Smith
1994 J jnl
A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem.
Oper. Res.
Manuel Laguna, Thomas A. Feo, Hal C. Elrod
1993 — conf
A GRASP for satisfiability.
Cliques, Coloring, and Satisfiability
Mauricio G. C. Resende, Thomas A. Feo
1993 J jnl
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs.
Oper. Res.
Thomas A. Feo, J. Scott Provan
1993 J jnl
Single machine scheduling with flow time and earliness penalties.
J. Glob. Optim.
Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo
1992 J jnl
One-Half Approximation Algorithms for the k-Partition Problem.
Oper. Res.
Thomas A. Feo, Olivier Goldschmidt, Mallek Khellaf
1991 J jnl
A GRASP
Comput. Oper. Res.
Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard
1990 J jnl
A class of bounded approximation algorithms for graph partitioning.
Networks
Thomas A. Feo, Mallek Khellaf
1990 J jnl
Bibliographic Section.
Transp. Sci.
Rubin Johnson, Thomas A. Feo, Bruce W. Lamar, Peter B. Belobaba, David A. Hensher, Robert A. Wolfe, Susan Hanson, Ilan Solomon
1988 J jnl
Bibliographic Section.
Transp. Sci.
Peter R. White, Kenneth E. Train, Hani S. Mahmassani, Thomas A. Feo
1986 J jnl
OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing.
Oper. Res.
Thomas A. Feo, Dorit S. Hochbaum