2012

Articles

• Mousseau, Vincent ; Chakhar, Salem ; Aissi, Hassene . GIS-based multicriteria evaluation approach for corridor siting. Environment and Planning B: Planning and Design. Volume 39. n° 2. 2012. pages 287-307. Pion. DOI http://dx.doi.org/10.1068/b37085.

2011

Articles

• Aissi, Hassene ; Aloulou, Mohamed Ali ; Kovalyov, Mikhail Y. . Minimizing the number of late jobs on a single machine under due date uncertainty. Journal of Scheduling. Volume 14. n° 4. 2011. pages 351-360. Springer. DOI http://dx.doi.org/10.1007/s10951-010-0183-z.

2010

Articles

• Vanderpooten, Daniel ; Bazgan, Cristina ; Aissi, Hassene . General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems. Discrete Optimization. Volume 7. n° 3. 2010. pages 136-148. Elsevier. DOI http://dx.doi.org/10.1016/j.disopt.2010.03.004.

Book chapters

• Aissi, Hassene ; Roy, Bernard . Robustness in Multi-Criteria Decision Aiding. Greco, Salvatore; Ehrgott, Matthias; Figueira, Jose Rui. Trends in Multiple Criteria Decision Analysis. Berlin. 2010. pages 87-121.

2009

Articles

• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Min–max and min–max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research. Volume 197. n° 2. 2009. pages 427-438. Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2008.09.012.

2008

Articles

• Vanderpooten, Daniel ; Bazgan, Cristina ; Aissi, Hassene . Complexity of the min-max (regret) versions of cut problems. Discrete Optimization. Volume 5. n° 1. 2008. pages 66-73. Elsevier Ltd. DOI http://dx.doi.org/10.1016/j.disopt.2007.11.008.

Working Papers

• Roy, Bernard ; Aissi, Hassene . Robustesse en aide multicritère à la décision. Université Paris-Dauphine . 2008 .

2007

Articles

• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximation of min-max and min-max regret versions of some combinatorial optimization problems. European Journal of Operational Research. Volume 179. n° 2. 2007. pages 281-290. Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2006.03.023.

2006

Conference Contributions

• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximating min-max (regret) versions of some polynomial problems. 12th Annual International Conference on Computing and Combinatorics (COCOON 2006). Taipei. Taïwan. 2006.

2005

Articles

• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Complexity of the min-max and min-max regret assignment problems. Operations Research Letters. Volume 33. n° 6. 2005. pages 634-640. Elsevier. DOI http://dx.doi.org/10.1016/j.orl.2004.12.002.

Conference Contributions

• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack. 13th Annual European Symposium on Algorithms (ESA 2005). Berlin. Espagne. 2005.
• Vanpeperstraete, Jean-Michel ; Aissi, Hassene ; Vanderpooten, Daniel . Robust approaches for the data association problem. 8th International Conference on Information Fusion, 2005. Philadelphie. États-Unis. 2005.
• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Pseudo-polynomial algorithms for min-max and min-max regret problems. Operations Research and Its Applications. The Fifth International Symposium, ISORA’05 Tibet, China, August 8–13, 2005 Proceedings. Beijing. Chine. 2005.
• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Complexity of the min-max (regret) versions of cut problems. 16th International Symposium on Algorithms and Computation (ISAAC 2005). Sanya (Hainan). Chine. 2005.