Hassene Aissi

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 11

Top Topics

Strongly Polynomial

Linear Relaxation

Top Venues

Publications

Hassene Aissi, Ali Ridha Mahjoub
On the minimum s-t cut problem with budget constraints. Math. Program. 203 (1) (2024)
Hassene Aissi, Da Qi Chen, R. Ravi
Vertex downgrading to minimize connectivity. Math. Program. 199 (1) (2023)
Hassene Aissi, Solal Attias, Da Qi Chen, R. Ravi
Unit Perturbations in Budgeted Spanning Tree Problems. CoRR (2022)
Hassene Aissi, Ali Ridha Mahjoub
On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. ISCO (2020)
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. IPCO (2020)
Hassene Aissi, Da Qi Chen, R. Ravi
Vertex Downgrading to Minimize Connectivity. SWAT (2020)
Hassene Aissi, Da Qi Chen, R. Ravi
Downgrading to Minimize Connectivity. CoRR (2019)
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
Faster Algorithms for Parametric Global Minimum Cut Problems. CoRR (2019)
Hassene Aissi, Ali Ridha Mahjoub, R. Ravi
Randomized Contractions for Multiobjective Minimum Cuts. ESA (2017)
Sami Kaddani, Daniel Vanderpooten, Jean Michel Vanpeperstraete, Hassene Aissi
Weighted sum model with partial preference information: Application to multi-objective optimization. Eur. J. Oper. Res. 260 (2) (2017)
Hassene Aissi, Daniel Vanderpooten
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. Networks 68 (3) (2016)
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154 (1-2) (2015)
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO (2014)
Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov
Minimizing the number of late jobs on a single machine under due date uncertainty. J. Sched. 14 (4) (2011)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret. Optim. 7 (3) (2010)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Min-max and min-max regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197 (2) (2009)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5 (1) (2008)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximation of min-max and min-max regret versions of some combinatorial optimization problems. Eur. J. Oper. Res. 179 (2) (2007)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON (2006)
Hassene Aissi
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. 4OR 4 (4) (2006)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA (2005)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC (2005)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33 (6) (2005)