Mahey Philippe

Philippe Mahey

Information about the author Philippe Mahey will soon be added to the site.
Found 11 papers in total
A survey on operator splitting and decomposition of convex programs
A survey on operator splitting and decomposition of convex programs
2017
Many structured convex minimization problems can be modeled by the search of a zero of...
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
2016
The routing and wavelength assignment (RWA) problem typically occurs in wavelength...
Variable neighborhood descent with iterated local search for routing and wavelength assignment
Variable neighborhood descent with iterated local search for routing and wavelength assignment
2012
In this work we treat the Routing and Wavelength Assignment (RWA) with focus on...
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
2008
We present cycle-based algorithmic approaches to find local minima of a nonconvex and...
Separable convexification and difference of convex functions techniques for capacity and flow assignment problems
Separable convexification and difference of convex functions techniques for capacity and flow assignment problems
2001
We study a continuous version of the capacity and flow assignment problem where the...
Minimum convex-cost tension problems on series-parallel graphs
Minimum convex-cost tension problems on series-parallel graphs
2003
We present briefly some results we obtained with known methods to solve minimum cost...
Multicommodity network expansion under elastic demands
Multicommodity network expansion under elastic demands
2001
We analyze some issues of network design and bandwidth allocation in telecommunication...
Packet routing in telecommunication networks with path and flow restrictions
Packet routing in telecommunication networks with path and flow restrictions
1999
We address packet-switched telecommunication networks, including ATM, SMDS, and X.25...
Iterative improvement methods for a multiperiod network design problem
Iterative improvement methods for a multiperiod network design problem
1998
We address an important problem in telecommunications planning: the multiperiod...
Separable Augmented Lagrangians for the decomposition of large convex programs
Separable Augmented Lagrangians for the decomposition of large convex programs
1995
Augmented Lagrangians are very attractive to regularize the classical dual methods for...
Using linear programming in Petri net analysis
Using linear programming in Petri net analysis
1989
The algebraic representation of polyhedral sets is an alternative tool for the...
Papers per page: