| Article ID: | iaor20083320 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 525 |
| End Page Number: | 532 |
| Publication Date: | Jul 2007 |
| Journal: | Operations Research Letters |
| Authors: | Zieliski Pawe, Kasperski Adam |
The general problem of minimizing the maximal regret in combinatorial optimization problems with interval costs is considered. Some results are proven that allow to obtain a fully polynomial time approximation scheme (FPTAS) for the problem under the assumption that a pseudopolynomial algorithm is given.