Philippe Mahey

According to our database1, Philippe Mahey authored at least 31 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Inertial-relaxed splitting for composite monotone inclusions.
Open J. Math. Optim., January, 2023

2021
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods.
Int. Trans. Oper. Res., 2021

2017
A survey on operator splitting and decomposition of convex programs.
RAIRO Oper. Res., 2017

Decomposition methods for a spatial model for long-term energy pricing problem.
Math. Methods Oper. Res., 2017

2016
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game.
Electron. Notes Discret. Math., 2016

Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem.
4OR, 2016

2013
A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards.
IEEE Trans. Comput. Intell. AI Games, 2013

Single string planning problem arising in liner shipping industries: A heuristic approach.
Comput. Oper. Res., 2013

2012
A robust controller for a two-layered approach applied to the game of billiards.
Entertain. Comput., 2012

Variable neighborhood descent with iterated local search for routing and wavelength assignment.
Comput. Oper. Res., 2012

2011
A VND-ILS Heuristic to Solve the RWA Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

Billiards: an optimization challenge.
Proceedings of the Fourth International C* Conference on Computer Science & Software Engineering, 2011

2010
Editorial. The MODE/ROADEF 2008 Conference.
RAIRO Oper. Res., 2010

<i>k</i>-Splittable delay constrained routing problem: A branch-and-price approach.
Networks, 2010

2008
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs.
Networks, 2008

Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths.
Eur. J. Oper. Res., 2008

2007
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs.
Oper. Res. Lett., 2007

Multicommodity flow problems with a bounded number of paths: A flow deviation approach.
Networks, 2007

Elastic time computation in QoS-driven hypermedia presentations.
Multim. Syst., 2007

k-splittable delay constrained routing problem: A branch and price approach.
Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006
Multicommodity Flow Problems and Decomposition in Telecommunications Networks.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2004
Minimum convex piecewise linear cost tension problem on quasi-<i>k</i> series-parallel graphs.
4OR, 2004

2003
Minimum convex-cost tension problems on series-parallel graphs.
RAIRO Oper. Res., 2003

2001
Capacity and flow assignment of data networks by generalized Benders decomposition.
J. Glob. Optim., 2001

2000
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems.
Eur. J. Oper. Res., 2000

1999
Packet Routing in Telecommunication Networks with Path and Flow Restrictions.
INFORMS J. Comput., 1999

1998
A new proximal decomposition algorithm for routing in telecommunication networks.
Networks, 1998

Iterative improvement methods for a multiperiod network design problem.
Eur. J. Oper. Res., 1998

1995
Proximal Decomposition on the Graph of a Maximal Monotone Operator.
SIAM J. Optim., 1995

1994
Proximal decomposition for multicommodity flow problems with convex costs.
Telecommun. Syst., 1994

1990
Méthodes de décomposition pour la programmation mathématique.
, 1990


  Loading...