Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference101 articles.
1. Aissi, H., 2005. Approximation et résolution des versions min-max et min–max regret de problèmes d’optimisation combinatoire, Université Paris-Dauphine, Thèse de Doctorat.
2. Robustness in multi-criteria decision aiding;Aissi,2009
3. Complexity of the min–max and min–max regret assignment problem;Aissi;Oper. Res. Lett.,2005
4. Aissi, H., Vanderpooten, D., Vanpeperstraete, J.M., 2005b. Robust approaches for the data association problem. In: Proceedings of the Eighth International Conference on Information Fusion (FUSION 2005), Philadelphia, USA.
5. Approximation of min–max and min–max regret versions of some combinatorial optimization problems;Aissi;Eur. J. Oper. Res.,2007
Cited by
188 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献