Hassene Aissi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hassene Aissi has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Maurice Queyranne
Sauder School of Business at the University of British Columbia
3 shared publications - S. Thomas McCormick
Sauder School of Business, University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada
3 shared publications - Ali Ridha Mahjoub
Université Paris-Dauphine, Paris, France
2 shared publications - Cristina Bazgan
Université Paris-Dauphine, PSL Research University, CNRS, UMR 7243, LAMSADE
2 shared publications A. Ridha Mahjoub
Paris Dauphine University
1 shared publication- Bernard Roy
Université Paris-Dauphine
1 shared publication
Latest Publications
- 23 June 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 203 (1-2) , 421-442
On the minimum $s-t$ cut problem with budget constraints- 23 June 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 203 (1-2) , 421-442
On the minimum $s-t$ cut problem with budget constraints- 22 July 2020
- Published by Springer Nature
- p. 81-88
On the Linear Relaxation of the $s-t$-cut Problem with Budget Constraints- 22 July 2020
- Published by Springer Nature
- p. 81-88
On the Linear Relaxation of the $s-t$-cut Problem with Budget Constraints- Open Access
- 14 April 2020
- Published by Springer Nature
- p. 27-39
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
- 14 April 2020
- Published by Springer Nature
- p. 27-39
Open AccessFaster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
- Open Access
Faster Algorithms for Parametric Global Minimum Cut Problems
The parametric global minimum cut problem concerns a graph $G = (V,E)$ where the cost of each edge is an affine function of a parameter $\mu \in \mathbb{R}^d$ for some fixed dimension $d$. We consider the problems of finding the next breakpoint in a given direction, and finding a parameter value with maximum minimum cut value. We develop strongly polynomial algorithms for these problems that are faster than a naive application of Megiddo's parametric search technique. Our results indicate that the next breakpoint problem is easier than the max value problem.Open AccessFaster Algorithms for Parametric Global Minimum Cut Problems
The parametric global minimum cut problem concerns a graph $G = (V,E)$ where the cost of each edge is an affine function of a parameter $\mu \in \mathbb{R}^d$ for some fixed dimension $d$. We consider the problems of finding the next breakpoint in a given direction, and finding a parameter value with maximum minimum cut value. We develop strongly polynomial algorithms for these problems that are faster than a naive application of Megiddo's parametric search technique. Our results indicate that the next breakpoint problem is easier than the max value problem. - 19 September 2015
- Published by Springer Nature in Mathematical Programming
- Vol. 154 (1-2) , 3-28
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- 19 September 2015
- Published by Springer Nature in Mathematical Programming
- Vol. 154 (1-2) , 3-28
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- 1 April 2012
- Published by SAGE Publications in Environment and Planning B: Planning and Design
- Vol. 39 (2) , 287-307
GIS-Based Multicriteria Evaluation Approach for Corridor Siting
Siting a linear facility such as a highway or a pipeline often requires a preliminary study in which one or several corridors are identified. Here we construct corridors as a collection of adjacent polygons specifying a ‘path’ from origin s to destination t. Formally, we make use of a graph, called the connectivity graph, in which vertices correspond to polygons and edges to adjacent polygons. Within this formal representation, a corridor corresponds to an s to t path in the connectivity graph. The corridors are evaluated on two criteria: (1) a quantitative criterion measuring the length of the corridor, and (2) a qualitative criterion measuring the quality of the corridor with respect to the suitability of crossing its component polygons. We first introduce a three-phase approach based on a coupling between a geographical information system (GIS) and multicriteria evaluation and devoted to handling biobjective corridor siting problems. Then, the proposed approach is validated through an example of a real-world application.
- 1 April 2012
- Published by SAGE Publications in Environment and Planning B: Planning and Design
- Vol. 39 (2) , 287-307
GIS-Based Multicriteria Evaluation Approach for Corridor Siting
Siting a linear facility such as a highway or a pipeline often requires a preliminary study in which one or several corridors are identified. Here we construct corridors as a collection of adjacent polygons specifying a ‘path’ from origin s to destination t. Formally, we make use of a graph, called the connectivity graph, in which vertices correspond to polygons and edges to adjacent polygons. Within this formal representation, a corridor corresponds to an s to t path in the connectivity graph. The corridors are evaluated on two criteria: (1) a quantitative criterion measuring the length of the corridor, and (2) a qualitative criterion measuring the quality of the corridor with respect to the suitability of crossing its component polygons. We first introduce a three-phase approach based on a coupling between a geographical information system (GIS) and multicriteria evaluation and devoted to handling biobjective corridor siting problems. Then, the proposed approach is validated through an example of a real-world application.
- Open Access
- 28 June 2010
- Published by Springer Nature
- p. 87-121
Robustness in Multi-criteria Decision Aiding
- 28 June 2010
- Published by Springer Nature
- p. 87-121
Open AccessRobustness in Multi-criteria Decision Aiding
- 24 June 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 14 (4) , 351-360
Minimizing the number of late jobs on a single machine under due date uncertainty
- 24 June 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 14 (4) , 351-360
Minimizing the number of late jobs on a single machine under due date uncertainty
- Open Access
- 29 February 2008
- Published by Elsevier in Discrete Optimization
- Vol. 5 (1) , 66-73
Complexity of the min–max (regret) versions of min cut problems
- 29 February 2008
- Published by Elsevier in Discrete Optimization
- Vol. 5 (1) , 66-73
Open AccessComplexity of the min–max (regret) versions of min cut problems
- Open Access
Min-max and min-max regret versions of some combinatorial optimization problems: a survey
Les critères min-max et min-max regret sont souvent utilisés en vue d'obtenir des solutions robustes. Après avoir motivé l'utilisation de ces critères, nous présentons des résultats généraux. Ensuite, nous donnons des résultats de complexité des versions min-max et min-max regret de quelques problèmes d'optimisation combinatoire : plus court chemin, arbre couvrant, affectation, coupe, s − t coupe, sac à dos. Comme la plupart de ces problèmes sont NP-difficiles, nous présentons des algorithmes d'approximation ainsi que des algorithmes exacts de résolution. Abstract Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, cut, s-t cut, knapsack. Since most of these problems are NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality.
Open AccessMin-max and min-max regret versions of some combinatorial optimization problems: a survey
Les critères min-max et min-max regret sont souvent utilisés en vue d'obtenir des solutions robustes. Après avoir motivé l'utilisation de ces critères, nous présentons des résultats généraux. Ensuite, nous donnons des résultats de complexité des versions min-max et min-max regret de quelques problèmes d'optimisation combinatoire : plus court chemin, arbre couvrant, affectation, coupe, s − t coupe, sac à dos. Comme la plupart de ces problèmes sont NP-difficiles, nous présentons des algorithmes d'approximation ainsi que des algorithmes exacts de résolution. Abstract Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, cut, s-t cut, knapsack. Since most of these problems are NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality.