Interval data minmax regret network optimization problems
Discrete Applied Mathematics
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
A constraint satisfaction approach to the robust spanning tree problem with interval data
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The robust shortest path problem in series-parallel multidigraphs with interval data
Operations Research Letters
Complexity of the min-max and min-max regret assignment problems
Operations Research Letters
The robust spanning tree problem with interval data
Operations Research Letters
A branch and bound algorithm for the robust shortest path problem with interval data
Operations Research Letters
Approximating Single Machine Scheduling with Scenarios
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the approximability of minmax (regret) network optimization problems
Information Processing Letters
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Discrete Optimization
Single machine scheduling with scenarios
Theoretical Computer Science
| Hi-index | 0.00 |
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.