Author:
Aissi Hassene,Bazgan Cristina,Vanderpooten Daniel
Subject
Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference65 articles.
1. Complexity of the min–max and min–max regret assignment problem;Aissi;Operations Research Letters,2005
2. Min–max (regret) versions of cut problems;Aissi,2005
3. Approximating min–max (regret) versions of some polynomial problems;Aissi,2006
4. Approximation of min–max and min–max regret versions of some combinatorial optimization problems;Aissi;European Journal of Operational Research,2007
5. H. Aissi, D. Vanderpooten, J.M. Vanpeperstraete, Robust approaches for the data association problem, in: Proceedings of the Eigth International Conference on Information Fusion (FUSION 2005), Philadelphia, USA, 2005. p. 6.
Cited by
341 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献