 | 2009 |
| 16 |  | Walid Ben-Ameur,
José Neto:
A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems.
CTW 2009: 105-108 |
| 2008 |
| 15 |  | Mohamed Chedly Ghedira,
Walid Ben-Ameur,
Hossam Afifi:
A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks.
ICN 2008: 692-697 |
| 14 |  | Walid Ben-Ameur,
José Neto:
A geometric characterization of "optimality-equivalent" relaxations.
J. Global Optimization 42(4): 533-547 (2008) |
| 13 |  | Walid Ben-Ameur,
José Neto:
Spectral bounds for the maximum cut problem.
Networks 52(1): 8-13 (2008) |
| 2007 |
| 12 |  | Walid Ben-Ameur,
José Neto:
Acceleration of cutting-plane and column generation algorithms: Applications to network design.
Networks 49(1): 3-17 (2007) |
| 11 |  | Walid Ben-Ameur,
Luis Gouveia:
Preface.
Networks 50(1): 1-2 (2007) |
| 2006 |
| 10 |  | Walid Ben-Ameur:
On the Maximum Cut Problem.
ACiD 2006: 154 |
| 9 |  | Walid Ben-Ameur,
Adam Ouorou:
Mathematical Models of the Delay Constrained Routing Problem.
Algorithmic Operations Research 1(2): (2006) |
| 8 |  | Walid Ben-Ameur,
Daniel Bienstock,
Iraj Saniee:
Foreword.
Annals OR 146(1): 1-2 (2006) |
| 7 |  | Walid Ben-Ameur:
New bounds for the maximum cut problem.
Electronic Notes in Discrete Mathematics 27: 5 (2006) |
| 6 |  | Walid Ben-Ameur,
José Neto:
A constraint generation algorithm for large scale linear programs using multiple-points separation.
Math. Program. 107(3): 517-537 (2006) |
| 5 |  | Walid Ben-Ameur,
Luis Gouveia:
Further contributions to network optimization.
Networks 48(1): 1-6 (2006) |
| 2004 |
| 4 |  | Walid Ben-Ameur,
Luis Gouveia:
Some recent contributions to network optimization.
Networks 44(1): 27-30 (2004) |
| 2003 |
| 3 |  | Walid Ben-Ameur,
Hervé Kerivin:
Networks new economical virtual private.
Commun. ACM 46(6): 69-73 (2003) |
| 2 |  | Walid Ben-Ameur,
Éric Gourdin:
Internet Routing and Related Topology Issues.
SIAM J. Discrete Math. 17(1): 18-49 (2003) |
| 2000 |
| 1 |  | Walid Ben-Ameur:
Constrained length connectivity and survivable networks.
Networks 36(1): 17-33 (2000) |