Hassene Aissi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2024

On the minimum s-t cut problem with budget constraintsHassene Aissi, Ali Ridha Mahjoub. mp, 203(1):421-442, January 2024. [doi]

2023

Vertex downgrading to minimize connectivityHassene Aissi, Da Qi Chen, R. Ravi 0001. mp, 199(1):215-249, May 2023. [doi]

2020

On the Linear Relaxation of the s-t-cut Problem with Budget ConstraintsHassene Aissi, Ali Ridha Mahjoub. iscopt 2020: 81-88 [doi]

Vertex Downgrading to Minimize ConnectivityHassene Aissi, Da Qi Chen, R. Ravi 0001. swat 2020: [doi]

Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum CutsHassene Aissi, S. Thomas McCormick, Maurice Queyranne. ipco 2020: 27-39 [doi]

2017

Randomized Contractions for Multiobjective Minimum CutsHassene Aissi, Ali Ridha Mahjoub, R. Ravi. esa 2017: [doi]

Weighted sum model with partial preference information: Application to multi-objective optimizationSami Kaddani, Daniel Vanderpooten, Jean Michel Vanpeperstraete, Hassene Aissi. eor, 260(2):665-679, 2017. [doi]

2016

Robust capacity expansion of a network under demand uncertainty: A bi-objective approachHassene Aissi, Daniel Vanderpooten. networks, 68(3):185-199, 2016. [doi]

2015

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphsHassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne. mp, 154(1-2):3-28, 2015. [doi]

2014

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum CutsHassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne. ipco 2014: 25-36 [doi]

2011

Minimizing the number of late jobs on a single machine under due date uncertaintyHassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov. scheduling, 14(4):351-360, 2011. [doi]

2010

Robustness in Multi-criteria Decision AidingHassene Aissi, Bernard Roy. In Matthias Ehrgott, José Rui Figueira, Salvatore Greco, editors, Trends in Multiple Criteria Decision Analysis. pages 87-121, Springer, 2010. [doi]

General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. disopt, 7(3):136-148, 2010. [doi]

2009

Min-max and min-max regret versions of combinatorial optimization problems: A surveyHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. eor, 197(2):427-438, 2009. [doi]

2008

Complexity of the min-max (regret) versions of min cut problemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. disopt, 5(1):66-73, 2008. [doi]

2007

Approximation of min-max and min-max regret versions of some combinatorial optimization problemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. eor, 179(2):281-290, 2007. [doi]

2006

Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problemsHassene Aissi. 4or, 4(4):347-350, 2006. [doi]

Approximating Min-Max (Regret) Versions of Some Polynomial ProblemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. cocoon 2006: 428-438 [doi]

2005

Complexity of the min-max and min-max regret assignment problemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. orl, 33(6):634-640, 2005. [doi]

Complexity of the Min-Max (Regret) Versions of Cut ProblemsHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. isaac 2005: 789-798 [doi]

Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and KnapsackHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. esa 2005: 862-873 [doi]

Sign in or sign up to see more results.

runs on WebDSL