Thomas A. Feo

From MaRDI portal
Person:686990

Available identifiers

zbMath Open feo.thomas-aMaRDI QIDQ686990

List of research outcomes





PublicationDate of PublicationType
Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP2000-01-03Paper
The Delta-Wye Approximation Procedure for Two-Terminal Reliability1997-07-23Paper
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties1997-04-10Paper
The Intermodal Trailer Assignment Problem1997-01-06Paper
Randomized methods for the number partitioning problem1997-01-06Paper
https://portal.mardi4nfdi.de/entity/Q56872701996-12-11Paper
Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly1995-09-25Paper
Greedy randomized adaptive search procedures1995-05-15Paper
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set1995-01-12Paper
A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem1995-01-12Paper
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs1994-03-21Paper
Single machine scheduling with flow time and earliness penalties1993-10-13Paper
One-Half Approximation Algorithms for the k-Partition Problem1992-06-28Paper
A GRASP for a difficult single machine scheduling problem1992-06-28Paper
Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs1990-01-01Paper
A class of bounded approximation algorithms for graph partitioning1990-01-01Paper
A probabilistic heuristic for a computationally difficult set covering problem1989-01-01Paper
Note—Operations Sequencing in Discrete Parts Manufacturing1989-01-01Paper
OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing1986-01-01Paper

Research outcomes over time

This page was built for person: Thomas A. Feo