Articles

Aissi H., Da Qi C., Ravi R. (2022), Vertex downgrading to minimize connectivity, Mathematical Programming

Kaddani S., Vanderpooten D., Vanpeperstraete J., Aissi H. (2017), Weighted sum model with partial preference information: application to Multi-Objective Optimization, European Journal of Operational Research, vol. 260, n°2, p. 665-679

Aissi H., Vanderpooten D. (2016), Robust capacity expansion of a network under demand uncertainty: a bi-objective approach, Networks, vol. 68, n°3, p. 185-199

Mousseau V., Aissi H., Chakhar S. (2012), GIS-based multicriteria evaluation approach for corridor siting, Environment and Planning B: Urban Analytics and City Science, vol. 39, n°2, p. 287-307

Aissi H., Kovalyov M., Aloulou M. (2011), Minimizing the number of late jobs on a single machine under due date uncertainty, Journal of Scheduling, vol. 14, n°4, p. 351-360

Aissi H., Bazgan C., Vanderpooten D. (2010), General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems, Discrete Optimization, vol. 7, n°3, p. 136-148

Aissi H., Bazgan C., Vanderpooten D. (2009), Min–max and min–max regret versions of combinatorial optimization problems: A survey, European Journal of Operational Research, vol. 197, n°2, p. 427-438

Aissi H., Bazgan C., Vanderpooten D. (2008), Complexity of the min-max (regret) versions of cut problems, Discrete Optimization, vol. 5, n°1, p. 66-73

Aissi H., Bazgan C., Vanderpooten D. (2007), Approximation of min-max and min-max regret versions of some combinatorial optimization problems, European Journal of Operational Research, vol. 179, n°2, p. 281-290

Aissi H. (2006), Approximation and resolution of min–max and min–max regret versions of combinatorial optimization problems, 4OR, vol. 4, n°4, p. 347-350

Aissi H., Bazgan C., Vanderpooten D. (2005), Complexity of the min-max and min-max regret assignment problems, Operations Research Letters, vol. 33, n°6, p. 634-640

Chapitres d'ouvrage

Aissi H., Roy B. (2010), Robustness in Multi-Criteria Decision Aiding, in Greco, Salvatore, Trends in Multiple Criteria Decision Analysis, Berlin: International Series in Operations Research & Management Science, p. 87-121

Communications avec actes

Nourry C., Mahjoub A., Aissi H. (2022), Étude de formulations étendues pour le problème de l'arbre couvrant budgeté, in , Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF)

Aissi H., McCormick S., Queyranne M. (2020), Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts, in , Berlin Heidelberg, Springer International Publishing, 27-39 p.

Aissi H., Mahjoub A. (2020), On the Linear Relaxation of the s-t-cut Problem with Budget Constraints, in Mourad Baïou ; Bernard Gendron ; Oktay Günlük ; A. Ridha Mahjoub, Berlin Heidelberg, Springer International Publishing, 81-88 p.

Aissi H., Mahjoub A., Ravi R. (2017), Randomized Contractions for Multiobjective Minimum Cuts, in Kirk Pruhs, Christian Sohler, 25th Annual European Symposium on Algorithms (ESA 2017), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 6:1-6:13 p.

Aissi H., Mahjoub A., McCormick S., Queyranne M. (2014), A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts, in Jon Lee, Jens Vygen, Integer Programming and Combinatorial Optimization 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings, Berlin, Springer, 25-36 p.

Aissi H., Bazgan C., Vanderpooten D. (2006), Approximating min-max (regret) versions of some polynomial problems, in Lee, D.T., Computing and Combinatorics 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, Taipei, Springer, 428-438 p.

Aissi H., Vanderpooten D., Vanpeperstraete J-M. (2005), Robust approaches for the data association problem, in , 8th International Conference on Information Fusion, 2005, Philadelphie, IEEE - Institute of Electrical and Electronics Engineers, 6 p.

Aissi H., Bazgan C., Vanderpooten D. (2005), Pseudo-polynomial algorithms for min-max and min-max regret problems, in Xian-Sun, Zhang, Operations Research and Its Applications. The Fifth International Symposium, ISORA’05 Tibet, China, August 8–13, 2005 Proceedings, Lhassa, World Publishing Corporation, 171-178 p.

Aissi H., Bazgan C., Vanderpooten D. (2005), Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack, in Leonardi, Stefano, Algorithms – ESA 2005 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, Palma de Mallorca, Springer, 862-873 p.

Aissi H., Bazgan C., Vanderpooten D. (2005), Complexity of the min-max (regret) versions of cut problems, in Du, Ding-Zhu, Algorithms and Computation 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, Sanya (Hainan), Springer, 789-798 p.

Prépublications / Cahiers de recherche

Aissi H., Roy B. (2008), Robustesse en aide multicritère à la décision, Paris, Université Paris-Dauphine, 42 p.