Thomas A. Feo

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.
ACM Trans. Math. Softw., 1998

1996
The Delta-Wye Approximation Procedure for Two-Terminal Reliability.
Oper. Res., 1996

A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties.
Comput. Oper. Res., 1996

Randomized methods for the number partitioning problem.
Comput. Oper. Res., 1996

1995
The Intermodal Trailer Assignment Problem.
Transp. Sci., 1995

Greedy Randomized Adaptive Search Procedures.
J. Glob. Optim., 1995

Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly.
Oper. Res., 1995

1994
A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem.
Oper. Res., 1994

A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.
Oper. Res., 1994

1993
Single machine scheduling with flow time and earliness penalties.
J. Glob. Optim., 1993

Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs.
Oper. Res., 1993

A GRASP for satisfiability.
Proceedings of the Cliques, 1993

1992
One-Half Approximation Algorithms for the k-Partition Problem.
Oper. Res., 1992

1991
A GRASP<sup>TM</sup> for a difficult single machine scheduling problem<sup>, </sup>.
Comput. Oper. Res., 1991

1990
Bibliographic Section.
Transp. Sci., 1990

A class of bounded approximation algorithms for graph partitioning.
Networks, 1990

1988
Bibliographic Section.
Transp. Sci., 1988

1986
OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing.
Oper. Res., 1986


  Loading...