| Min–max and min–max regret versions of combinatorial optimization problems: A survey H Aissi, C Bazgan, D Vanderpooten European journal of operational research 197 (2), 427-438, 2009 | 610 | 2009 |
| Complexity of the min–max and min–max regret assignment problems H Aissi, C Bazgan, D Vanderpooten Operations research letters 33 (6), 634-640, 2005 | 117 | 2005 |
| Weighted sum model with partial preference information: Application to multi-objective optimization S Kaddani, D Vanderpooten, JM Vanpeperstraete, H Aissi European Journal of Operational Research 260 (2), 665-679, 2017 | 90 | 2017 |
| Approximation of min–max and min–max regret versions of some combinatorial optimization problems H Aissi, C Bazgan, D Vanderpooten European Journal of Operational Research 179 (2), 281-290, 2007 | 82 | 2007 |
| Robustness in multi-criteria decision aiding H Aissi, B Roy Trends in multiple criteria decision analysis, 87-121, 2010 | 54 | 2010 |
| Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack H Aissi, C Bazgan, D Vanderpooten Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005 | 47 | 2005 |
| General approximation schemes for min–max (regret) versions of some (pseudo-) polynomial problems H Aissi, C Bazgan, D Vanderpooten Discrete Optimization 7 (3), 136-148, 2010 | 41 | 2010 |
| GIS-based multicriteria evaluation approach for corridor siting H Aissi, S Chakhar, V Mousseau Environment and Planning B: Planning and Design 39 (2), 287-307, 2012 | 40 | 2012 |
| Approximating min-max (regret) versions of some polynomial problems H Aissi, C Bazgan, D Vanderpooten Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006 | 39 | 2006 |
| Minimizing the number of late jobs on a single machine under due date uncertainty H Aissi, MA Aloulou, MY Kovalyov Journal of Scheduling 14, 351-360, 2011 | 35 | 2011 |
| Complexity of the min-max (regret) versions of cut problems H Aissi, C Bazgan, D Vanderpooten Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005 | 32 | 2005 |
| Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs H Aissi, AR Mahjoub, ST McCormick, M Queyranne Mathematical Programming 154, 3-28, 2015 | 22 | 2015 |
| Complexity of the min–max (regret) versions of min cut problems H Aissi, C Bazgan, D Vanderpooten Discrete Optimization 5 (1), 66-73, 2008 | 19 | 2008 |
| Pseudo-polynomial algorithms for min-max and min-max regret problems H Aissi, C Bazgan, D Vanderpooten Proceedings of the 5th International Symposium on Operations Research and …, 2005 | 15 | 2005 |
| Robust approaches for the data association problem H Aissi, D Vanderpooten, JM Vanpeperstraete 2005 7th International Conference on Information Fusion 1, 6 pp., 2005 | 10 | 2005 |
| A strongly polynomial time algorithm for multicriteria global minimum cuts H Aissi, AR Mahjoub, ST McCormick, M Queyranne International Conference on Integer Programming and Combinatorial …, 2014 | 7 | 2014 |
| Robust capacity expansion of a network under demand uncertainty: A bi‐objective approach H Aissi, D Vanderpooten Networks 68 (3), 185-199, 2016 | 6 | 2016 |
| Approximation et résolution des versions min-max et min-max regret de problèmes d'optimisation combinatoire H Aissi Paris 9, 2005 | 6 | 2005 |
| Faster algorithms for next breakpoint and max value for parametric global minimum cuts H Aissi, ST McCormick, M Queyranne International Conference on Integer Programming and Combinatorial …, 2020 | 5* | 2020 |
| Randomized contractions for multiobjective minimum cuts H Aissi, AR Mahjoub, R Ravi 25th Annual European Symposium on Algorithms (ESA 2017), 2017 | 4 | 2017 |
