General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems-Reference-Cited by-同舟云学术

General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems

Published:2010-08 Issue:3 Volume:7 Page:136-148
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Aissi Hassene,Bazgan Cristina,Vanderpooten Daniel

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference20 articles.

1. Robust Discrete Optimization and its Applications;Kouvelis,1997

2. Min–max and min–max regret versions of combinatorial optimization problems: a survey;Aissi;European Journal of Operational Research,2009

3. Approximation of min–max and min–max regret versions of some combinatorial optimization problems;Aissi;European Journal of Operational Research,2007

4. C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: IEEE Symposium on Foundations of Computer Science, FOCS 2000, Redondo Beach, California, USA, 2000, pp. 86–92.

5. Approximation of Pareto optima in multiple-objective, shortest-path problems;Warburton;Operations Research,1987

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective;European Journal of Operational Research;2023-10

2. Minimising weighted completion time on a single machine under uncertain weights;International Journal of Automation and Control;2022

3. Approximating combinatorial optimization problems with the ordered weighted averaging criterion;European Journal of Operational Research;2020-11

4. An evolutionary algorithm for the robust maximum weighted independent set problem;Automatika;2020-07-21

5. Heuristic solutions to robust variants of the minimum-cost integer flow problem;Journal of Heuristics;2020-02-14