| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Walid Ben-Ameur, Mohamed Didi Biha |
On the minimum cut separator problem.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache |
Virtual network provisioning across multiple substrate networks. |
Computer Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, José Neto |
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Bauguion, Walid Ben-Ameur, Éric Gourdin |
Cache Location in Tree Networks: Preliminary Results. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Mohamed Didi Biha |
Algorithms and formulations for the minimum cut separator problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Makhlouf Hadji |
Steiner Networks with unicyclic connected components. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Mateusz Zotkiewicz |
Polynomial traffic demand polytope partitioning. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro |
Failure disjoint paths. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou |
Networks with unicyclic connected components and without short cycles. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, José Neto |
Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro |
Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks. |
IEEE Communications Letters |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Makhlouf Hadji |
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Pablo Pavón Mariño, Michal Pióro |
On Traffic Domination in Communication Networks. |
PERFORM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mateusz Zotkiewicz, Walid Ben-Ameur |
More Adaptive Robust Stable Routing. |
GLOBECOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, José Neto |
A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Walid Ben-Ameur, José Neto |
Spectral bounds for the maximum cut problem. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, José Neto |
A geometric characterization of "optimality-equivalent" relaxations. |
J. Global Optimization |
2008 |
DBLP DOI BibTeX RDF |
Convex relaxation, Sensitivity analysis, Convex geometry |
| 1 | Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi |
A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks. |
ICN |
2008 |
DBLP DOI BibTeX RDF |
Optimization, Coverage, Vehicular networks, Route guidance |
| 1 | Walid Ben-Ameur, Luis Gouveia |
Preface. |
Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, José Neto |
Acceleration of cutting-plane and column generation algorithms: Applications to network design. |
Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Meriema Belaidouni, Walid Ben-Ameur |
On the minimum cost multiple-source unsplittable flow problem. |
RAIRO - Operations Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur |
New bounds for the maximum cut problem. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Luis Gouveia |
Further contributions to network optimization. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee |
Foreword. |
Annals OR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Adam Ouorou |
Mathematical Models of the Delay Constrained Routing Problem. |
Algorithmic Operations Research |
2006 |
DBLP BibTeX RDF |
|
| 1 | Walid Ben-Ameur, José Neto |
A constraint generation algorithm for large scale linear programs using multiple-points separation. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject classification (2000) 20E28, 20G40, 20C20 |
| 1 | Walid Ben-Ameur |
On the Maximum Cut Problem. |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Luis Gouveia |
Some recent contributions to network optimization. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Hervé Kerivin |
Networks new economical virtual private. |
Commun. ACM |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Éric Gourdin |
Internet Routing and Related Topology Issues. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Walid Ben-Ameur |
Multi-hour design of survivable classical IP networks. |
Int. J. Communication Systems |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, B. Liau |
Calcul des métriques de routage pour Internet. |
Annales des Télécommunications |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur |
Constrained length connectivity and survivable networks. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")