Thomas A. Feo

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP ACM Transactions on Mathematical Software	2000-01-03	Paper
The Delta-Wye Approximation Procedure for Two-Terminal Reliability Operations Research	1997-07-23	Paper
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties Computers & Operations Research	1997-04-10	Paper
The Intermodal Trailer Assignment Problem Transportation Science	1997-01-06	Paper
Randomized methods for the number partitioning problem Computers & Operations Research	1997-01-06	Paper
scientific article; zbMATH DE number 956862 (Why is no real title available?)	1996-12-11	Paper
Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly Operations Research	1995-09-25	Paper
Greedy randomized adaptive search procedures Journal of Global Optimization	1995-05-15	Paper
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set Operations Research	1995-01-12	Paper
A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem Operations Research	1995-01-12	Paper
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs Operations Research	1994-03-21	Paper
Single machine scheduling with flow time and earliness penalties Journal of Global Optimization	1993-10-13	Paper
One-Half Approximation Algorithms for the k-Partition Problem Operations Research	1992-06-28	Paper
A GRASP for a difficult single machine scheduling problem Computers & Operations Research	1992-06-28	Paper
Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs IEEE Transactions on Reliability	1990-01-01	Paper
A class of bounded approximation algorithms for graph partitioning Networks	1990-01-01	Paper
A probabilistic heuristic for a computationally difficult set covering problem Operations Research Letters	1989-01-01	Paper
Note—Operations Sequencing in Discrete Parts Manufacturing Management Science	1989-01-01	Paper
OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing Operations Research	1986-01-01	Paper

Research outcomes over time

This page was built for person: Thomas A. Feo