Philippe Mahey

31 papers C 1Journal 26Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design.
Ann. Oper. Res.
Rui Sa Shibasaki, Mourad Baïou, Francisco Barahona, Philippe Mahey, Maurício C. de Souza
2023 J jnl
Inertial-relaxed splitting for composite monotone inclusions.
Open J. Math. Optim.
Ernesto Oré, Philippe Mahey, Eladio Ocaña
2021 J jnl
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods.
Int. Trans. Oper. Res.
Rui Sa Shibasaki, Mourad Baïou, Francisco Barahona, Philippe Mahey, Maurício C. de Souza
2017 J jnl
A survey on operator splitting and decomposition of convex programs.
RAIRO Oper. Res.
Arnaud Lenoir, Philippe Mahey
2017 J jnl
Decomposition methods for a spatial model for long-term energy pricing problem.
Math. Methods Oper. Res.
Philippe Mahey, Jonas Koko, Arnaud Lenoir
2016 J jnl
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game.
Electron. Notes Discret. Math.
Vinicius Morais, Alexandre Salles da Cunha, Philippe Mahey
2016 J jnl
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem.
4OR
Christophe Duhamel, Philippe Mahey, Alexandre Xavier Martins, Rodney Rezende Saldanha, Maurício C. de Souza
2013 J jnl
A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards.
IEEE Trans. Comput. Intell. AI Games
Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey
2013 J jnl
Single string planning problem arising in liner shipping industries: A heuristic approach.
Comput. Oper. Res.
Shahin Gelareh, Rahimeh Neamatian Monemi, Philippe Mahey, Nelson Maculan, David Pisinger
2012 J jnl
A robust controller for a two-layered approach applied to the game of billiards.
Entertain. Comput.
Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey
2012 J jnl
Variable neighborhood descent with iterated local search for routing and wavelength assignment.
Comput. Oper. Res.
Alexandre Xavier Martins, Christophe Duhamel, Philippe Mahey, Rodney Rezende Saldanha, Maurício C. de Souza
2011 C conf
A VND-ILS Heuristic to Solve the RWA Problem.
INOC
Alexandre Xavier Martins, Christophe Duhamel, Maurício Cardoso de Souza, Rodney Rezende Saldanha, Philippe Mahey
2011 — conf
Billiards: an optimization challenge.
C3S2E
Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey
2010 J jnl
Editorial. The MODE/ROADEF 2008 Conference.
RAIRO Oper. Res.
Philippe Mahey, Alain Quilliot
2008 J jnl
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs.
Networks
Maurício C. de Souza, Philippe Mahey, Bernard Gendron
2008 J jnl
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths.
Eur. J. Oper. Res.
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey
2007 J jnl
Elastic time computation in QoS-driven hypermedia presentations.
Multim. Syst.
Bruno Bachelet, Philippe Mahey, Rogério Rodrigues, Luiz Fernando Soares
2007 J jnl
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs.
Oper. Res. Lett.
Philippe Mahey, Maurício C. de Souza
2007 J jnl
Multicommodity flow problems with a bounded number of paths: A flow deviation approach.
Networks
Christophe Duhamel, Philippe Mahey
2007 — conf
k-splittable delay constrained routing problem: A branch and price approach.
DRCN
Jérôme Truffot, Christophe Duhamel, Philippe Mahey
2006 — ch.
Multicommodity Flow Problems and Decomposition in Telecommunications Networks.
Handbook of Optimization in Telecommunications
Abdel Lisser, Philippe Mahey
2004 J jnl
Minimum convex piecewise linear cost tension problem on quasi-
4OR
Bruno Bachelet, Philippe Mahey
2003 J jnl
Minimum convex-cost tension problems on series-parallel graphs.
RAIRO Oper. Res.
Bruno Bachelet, Philippe Mahey
2001 J jnl
Capacity and flow assignment of data networks by generalized Benders decomposition.
J. Glob. Optim.
Philippe Mahey, Abdelhamid Benchakroun, Florence Boyer
2000 J jnl
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems.
Eur. J. Oper. Res.
Adam Ouorou, Philippe Mahey
1999 J jnl
Packet Routing in Telecommunication Networks with Path and Flow Restrictions.
INFORMS J. Comput.
Larry J. LeBlanc, Jerome Chifflet, Philippe Mahey
1998 J jnl
A new proximal decomposition algorithm for routing in telecommunication networks.
Networks
Philippe Mahey, Adam Ouorou, Larry J. LeBlanc, Jerome Chifflet
1998 J jnl
Iterative improvement methods for a multiperiod network design problem.
Eur. J. Oper. Res.
Bruno-Laurent Garcia, Philippe Mahey, Larry J. LeBlanc
1995 J jnl
Proximal Decomposition on the Graph of a Maximal Monotone Operator.
SIAM J. Optim.
Philippe Mahey, Said Oualibouch, Pham Dinh Tao
1994 J jnl
Proximal decomposition for multicommodity flow problems with convex costs.
Telecommun. Syst.
Jerome Chifflet, Philippe Mahey, V. Reynier
1990 — book
Méthodes de décomposition pour la programmation mathématique.
Philippe Mahey