WBWalid Ben-Ameur
Walid Ben-Ameur
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Walid Ben-Ameur has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Eric Gourdin
Orange Research Châtillon France
1 shared publication - José Neto
Institut TELECOM, TELECOM SudParis, CNRS UMR 5157, 9 Rue Charles Fourier, 91011 Evry Cedex, France
1 shared publication - Mateusz Żotkiewicz
Warsaw University of Technology
1 shared publication Mohamed Didi Biha
LMNO, Université de Caen, BP 5186, F14032 Caen Cedex, France
1 shared publication- Mohamed Didi Biha
Labratoire des Mathématiques Nicolas Oresm CNRS UMR 6139 Normandie Université UNICAEN 14032 Caen Cedex France
1 shared publication - Mohamed Didi Biha
Université de Caen Basse-Normandie, France
1 shared publication
Latest Publications
- 4 November 2014
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 31 (3) , 1034-1044
Extended cuts
- 4 November 2014
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 31 (3) , 1034-1044
Extended cuts
- 10 June 2013
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 41, 311-318
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow
- 10 June 2013
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 41, 311-318
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow
On the minimum cut separator problem
Given G = (V,E) an undirected graph and two specified nonadjacent nodes a and b of V, a cut separator is a subset F =δ (C) ⊆ E such that a,b∈V / C and a and b belong to different connected components of the graph induced by V / C. Given a non‐negative cost vector \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath, amssymb} \pagestyle{empty} \begin{align*}c\in\mathbb{R}^{|E|}_{+}\end{align*} , the cut separator problem is to find a cut separator of minimum cost. This new problem can be seen as a generalization of the vertex separator problem. In this article, we give a polynomial time algorithm for this problem. We also present six equivalent linear programming formulations, and we show their tightness. Using these results we obtain an explicit short polyhedral description of the dominant of the cut separator polytope. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012On the minimum cut separator problem
Given G = (V,E) an undirected graph and two specified nonadjacent nodes a and b of V, a cut separator is a subset F =δ (C) ⊆ E such that a,b∈V / C and a and b belong to different connected components of the graph induced by V / C. Given a non‐negative cost vector \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath, amssymb} \pagestyle{empty} \begin{align*}c\in\mathbb{R}^{|E|}_{+}\end{align*} , the cut separator problem is to find a cut separator of minimum cost. This new problem can be seen as a generalization of the vertex separator problem. In this article, we give a polynomial time algorithm for this problem. We also present six equivalent linear programming formulations, and we show their tightness. Using these results we obtain an explicit short polyhedral description of the dominant of the cut separator polytope. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012- 9 September 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (2)
Volume-oriented routing and its modifications
- 9 September 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (2)
Volume-oriented routing and its modifications
- 13 October 2010
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (16) , 1689-1698
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- 13 October 2010
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (16) , 1689-1698
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- 1 August 2010
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 36, 977-983
Algorithms and formulations for the minimum cut separator problem
- 1 August 2010
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 36, 977-983
Algorithms and formulations for the minimum cut separator problem