Hassene Aissi
Title
Cited by
Cited by
Year
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
4432009
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
1052005
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
632007
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
H Aissi, C Bazgan, D Vanderpooten
European Symposium on Algorithms, 862-873, 2005
412005
Robustness in multi-criteria decision aiding
H Aissi, B Roy
Trends in multiple criteria decision analysis, 87-121, 2010
402010
Approximating min-max (regret) versions of some polynomial problems
H Aissi, C Bazgan, D Vanderpooten
International Computing and Combinatorics Conference, 428-438, 2006
372006
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
352017
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
342012
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
332010
Minimizing the number of late jobs on a single machine under due date uncertainty
H Aissi, MA Aloulou, MY Kovalyov
Journal of Scheduling 14 (4), 351-360, 2011
312011
Complexity of the min-max (regret) versions of cut problems
H Aissi, C Bazgan, D Vanderpooten
International Symposium on Algorithms and Computation, 789-798, 2005
302005
Complexity of the min–max (regret) versions of min cut problems
H Aissi, C Bazgan, D Vanderpooten
Discrete optimization 5 (1), 66-73, 2008
172008
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 (1), 3-28, 2015
132015
Robust approaches for the data association problem
H Aissi, D Vanderpooten, JM Vanpeperstraete
2005 7th International Conference on Information Fusion 1, 6 pp., 2005
112005
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
112005
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
72014
Approximation et résolution des versions min-max et min-max regret de problèmes d'optimisation combinatoire
H Aissi
Paris 9, 2005
62005
Robust capacity expansion of a network under demand uncertainty: A bi‐objective approach
H Aissi, D Vanderpooten
Networks 68 (3), 185-199, 2016
52016
Min-max and min-max regret versions of some combinatorial optimization problems: a survey
H Aissi, C Bazgan, D Vanderpooten
52007
A three-phase approach and a fast algorithm to compute efficient corridors within GIS framework
V Mousseau, H Aissi, S Chakhar
42010
The system can't perform the operation now. Try again later.
Articles 1–20