Hassene Aissi

According to our database, Hassene Aissi authored at least 23 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the minimum s-t cut problem with budget constraints.

Hassene Aissi, Ali Ridha Mahjoub

Math. Program., January, 2024

2023

Vertex downgrading to minimize connectivity.

Hassene Aissi, Da Qi Chen, R. Ravi

Math. Program., May, 2023

2022

Unit Perturbations in Budgeted Spanning Tree Problems.

Hassene Aissi, Solal Attias, Da Qi Chen, R. Ravi

CoRR, 2022

2020

On the Linear Relaxation of the s-t-cut Problem with Budget Constraints.

Hassene Aissi, Ali Ridha Mahjoub

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts.

Hassene Aissi, S. Thomas McCormick, Maurice Queyranne

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Faster Algorithms for Parametric Global Minimum Cut Problems.

Hassene Aissi, S. Thomas McCormick, Maurice Queyranne

CoRR, 2019

Downgrading to Minimize Connectivity.

Hassene Aissi, Da Qi Chen, R. Ravi

CoRR, 2019

2017

Weighted sum model with partial preference information: Application to multi-objective optimization.

Sami Kaddani, Daniel Vanderpooten, Jean Michel Vanpeperstraete, Hassene Aissi

Eur. J. Oper. Res., 2017

Randomized Contractions for Multiobjective Minimum Cuts.

Hassene Aissi, Ali Ridha Mahjoub, R. Ravi

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Robust capacity expansion of a network under demand uncertainty: A bi-objective approach.

Hassene Aissi, Daniel Vanderpooten

Networks, 2016

2015

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.

Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne

Math. Program., 2015

2014

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.

Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2011

Minimizing the number of late jobs on a single machine under due date uncertainty.

Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov

J. Sched., 2011

2010

General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Discret. Optim., 2010

Robustness in Multi-criteria Decision Aiding.

Hassene Aissi, Bernard Roy

Proceedings of the Trends in Multiple Criteria Decision Analysis, 2010

2009

Min-max and min-max regret versions of combinatorial optimization problems: A survey.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Eur. J. Oper. Res., 2009

2008

Complexity of the min-max (regret) versions of min cut problems.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Discret. Optim., 2008

2007

Approximation of min-max and min-max regret versions of some combinatorial optimization problems.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Eur. J. Oper. Res., 2007

2006

Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.

Hassene Aissi

4OR, 2006

Approximating Min-Max (Regret) Versions of Some Polynomial Problems.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Complexity of the min-max and min-max regret assignment problems.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Oper. Res. Lett., 2005

Complexity of the Min-Max (Regret) Versions of Cut Problems.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten

Proceedings of the Algorithms, 2005