| 2008 |
|---|
| 7 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Complexity of the min-max (regret) versions of min cut problems.
Discrete Optimization 5(1): 66-73 (2008) |
| 2007 |
|---|
| 6 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Approximation of min-max and min-max regret versions of some combinatorial optimization problems.
European Journal of Operational Research 179(2): 281-290 (2007) |
| 2006 |
|---|
| 5 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Approximating Min-Max (Regret) Versions of Some Polynomial Problems.
COCOON 2006: 428-438 |
| 4 | EE | Hassene Aissi:
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.
4OR 4(4): 347-350 (2006) |
| 2005 |
|---|
| 3 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.
ESA 2005: 862-873 |
| 2 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Complexity of the Min-Max (Regret) Versions of Cut Problems.
ISAAC 2005: 789-798 |
| 1 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Complexity of the min-max and min-max regret assignment problems.
Oper. Res. Lett. 33(6): 634-640 (2005) |
