Hassene Aissi

25 papers A 2B 3C 1Misc 1Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
New bounds for the number of lightest cycles in undirected graphs.
Inf. Process. Lett.
Hassene Aissi, Mourad Baïou, Francisco Barahona
2024 J jnl
On the minimum s-t cut problem with budget constraints.
Math. Program.
Hassene Aissi, Ali Ridha Mahjoub
2023 J jnl
Vertex downgrading to minimize connectivity.
Math. Program.
Hassene Aissi, Da Qi Chen, R. Ravi
2022 J jnl
Unit Perturbations in Budgeted Spanning Tree Problems.
CoRR
Hassene Aissi, Solal Attias, Da Qi Chen, R. Ravi
2020 B conf
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts.
IPCO
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
2020 C conf
On the Linear Relaxation of the s-t-cut Problem with Budget Constraints.
ISCO
Hassene Aissi, Ali Ridha Mahjoub
2020 — conf
Vertex Downgrading to Minimize Connectivity.
SWAT
Hassene Aissi, Da Qi Chen, R. Ravi
2019 J jnl
Downgrading to Minimize Connectivity.
CoRR
Hassene Aissi, Da Qi Chen, R. Ravi
2019 J jnl
Faster Algorithms for Parametric Global Minimum Cut Problems.
CoRR
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
2017 A conf
Randomized Contractions for Multiobjective Minimum Cuts.
ESA
Hassene Aissi, Ali Ridha Mahjoub, R. Ravi
2017 J jnl
Weighted sum model with partial preference information: Application to multi-objective optimization.
Eur. J. Oper. Res.
Sami Kaddani, Daniel Vanderpooten, Jean Michel Vanpeperstraete, Hassene Aissi
2016 J jnl
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach.
Networks
Hassene Aissi, Daniel Vanderpooten
2015 J jnl
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
Math. Program.
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
2014 B conf
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.
IPCO
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
2011 J jnl
Minimizing the number of late jobs on a single machine under due date uncertainty.
J. Sched.
Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov
2010 J jnl
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems.
Discret. Optim.
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2010 — ch.
Robustness in Multi-criteria Decision Aiding.
Trends in Multiple Criteria Decision Analysis
Hassene Aissi, Bernard Roy
2009 J jnl
Min-max and min-max regret versions of combinatorial optimization problems: A survey.
Eur. J. Oper. Res.
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2008 J jnl
Complexity of the min-max (regret) versions of min cut problems.
Discret. Optim.
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2007 J jnl
Approximation of min-max and min-max regret versions of some combinatorial optimization problems.
Eur. J. Oper. Res.
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2006 Misc conf
Approximating Min-Max (Regret) Versions of Some Polynomial Problems.
COCOON
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2006 J jnl
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.
4OR
Hassene Aissi
2005 A conf
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.
ESA
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2005 B conf
Complexity of the Min-Max (Regret) Versions of Cut Problems.
ISAAC
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
2005 J jnl
Complexity of the min-max and min-max regret assignment problems.
Oper. Res. Lett.
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten