Thomas A. Feo

According to our database, Thomas A. Feo authored at least 18 papers between 1986 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1998

Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.

Mauricio G. C. Resende, Thomas A. Feo, Stuart H. Smith

ACM Trans. Math. Softw., 1998

1996

The Delta-Wye Approximation Procedure for Two-Terminal Reliability.

Manoj K. Chari, Thomas A. Feo, J. Scott Provan

Oper. Res., 1996

A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties.

Thomas A. Feo, Kishore Sarathy, John McGahan

Comput. Oper. Res., 1996

Randomized methods for the number partitioning problem.

Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt

Comput. Oper. Res., 1996

1995

The Intermodal Trailer Assignment Problem.

Thomas A. Feo, José Luis González Velarde

Transp. Sci., 1995

Greedy Randomized Adaptive Search Procedures.

Thomas A. Feo, Mauricio G. C. Resende

J. Glob. Optim., 1995

Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly.

Thomas A. Feo, Jonathan F. Bard, Scott D. Holland

Oper. Res., 1995

1994

A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem.

Manuel Laguna, Thomas A. Feo, Hal C. Elrod

Oper. Res., 1994

A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.

Thomas A. Feo, Mauricio G. C. Resende, Stuart H. Smith

Oper. Res., 1994

1993

Single machine scheduling with flow time and earliness penalties.

Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo

J. Glob. Optim., 1993

Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs.

Thomas A. Feo, J. Scott Provan

Oper. Res., 1993

A GRASP for satisfiability.

Mauricio G. C. Resende, Thomas A. Feo

Proceedings of the Cliques, 1993

1992

One-Half Approximation Algorithms for the k-Partition Problem.

Thomas A. Feo, Olivier Goldschmidt, Mallek Khellaf

Oper. Res., 1992

1991

A GRASP^TM for a difficult single machine scheduling problem^,.

Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard

Comput. Oper. Res., 1991

1990

Bibliographic Section.

Rubin Johnson, Thomas A. Feo, Bruce W. Lamar, Peter B. Belobaba, David A. Hensher, Robert A. Wolfe, Susan Hanson, Ilan Solomon

Transp. Sci., 1990

A class of bounded approximation algorithms for graph partitioning.

Thomas A. Feo, Mallek Khellaf

Networks, 1990

1988

Bibliographic Section.

Peter R. White, Kenneth E. Train, Hani S. Mahmassani, Thomas A. Feo

Transp. Sci., 1988

1986

OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing.

Thomas A. Feo, Dorit S. Hochbaum

Oper. Res., 1986