Document sans-titre

Publications

A. Lenoir et P. Mahey.
"Accelerating a class of splitting algorithms by iterative foldings", Acta Mathematica Vietnamica , vol. 39, n°1, 2009, pp. 49--65

C. Duhamel, P. Mahey, J. Truffot.
"k-splittable flow problem with QoS constraints: a branch-and-price approach , Networks, to appear, 2009

Rapport intégral :

M.C. de Souza, P. Mahey et B. Gendron.
"Cycle-based algorithms for multicommodity network flow problems with piecewise convex costs", Networks , vol. 51, n°2, 2008, pp. 133--141

Rapport intégral :

B. Vatinlen , F. Chauvet, P. Chrétienne et P. Mahey.
"Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths", European Journal in Operations Research , vol. 185, n°3, 2008, pp. 1390--1401

Rapport intégral :

B. Bachelet, P. Mahey, R. Rodrigues, L.F. G. Soares.
"Elastic time computation in QoS-driven hypermedia presentation", ACM-SIGMM Multimedia System Journal , vol. 12, 2007, pp. 461--478

Rapport intégral :

P. Mahey et M.C. de Souza.
"Local optimality conditions for multicommodity flow problems with separable piecewise convex costs", Operations Research Letters, vol. 35, 2007, pp. 221--226

Rapport intégral :

P. Mahey et C. Duhamel.
"Multicommodity flows with a bounded number of paths; a Flow Deviation approach", Networks, vol. 49, n°1, 2006, pp. 80--89

Rapport intégral :

O.M. Gueye, J.P. Dussault et P. Mahey.
"Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming", JOTA, Journal of Optimization Theory and Applications, vol. 127, n°2,2005, pp. 329--345

Rapport intégral :

B. Bachelet et P. Mahey.
"Minimum convex piecewise-linear cost tension problems on quasi-series-parallel graphs", 4OR Quarterly Journal of Belgian, Franch, Italian OR Societies vol. 2, n°4, 2004, pp. 275--291

B. Bachelet et P. Mahey.
"Minimum convex-cost tension problems on series-parallel graphs", Research Report LIMOS/RR03-06, RAIRO-Operations Resarch vol. 37, 4 2003, pp. 221--234

Rapport intégral :

C.C. Ribeiro et P. Mahey.
"Optimal routing for multiservice communication networks", OR/MS Today 29, 3 (2002), pp. 32--35

P. Mahey.
"Decomposition methods for Mathematical Programming", in Handbook of Applied Optimization, P. Pardalos and M.G.C. Resende eds., chap. 7, Oxford University Press 2002

P. Mahey , A. Benchakroun et F. Boyer.
"Capacity and flow assignment of data networks by generalized Benders decomposition", Journal of Global Optimization vol. 20, 2 (2001), pp.173-193

Rapport intégral :

P. Mahey, Thai Q. Phong et H.P.L. Luna.
"Separable convexification and DCA techniques for capacity and flow assignment", RAIRO-Recherche Opérationnelle 35 (2001), pp.269-281

Rapport intégral :

H.P.L. Luna , C.D. Randazzo et P. Mahey.
"Benders decomposition for local access network design with two technologies", Discrete Math. and Theoretical Computer Science 4 (2001), pp. 235-246

Rapport intégral :

A. Ouorou, H.P. Luna et P. Mahey.
"Multicommodity network expansion under elastic demands", Optimization and Engineering 2 (2001), pp. 277-292

Rapport intégral :

A. Ouorou, P. Mahey.
"Minimum mean-cycles cancelling method for nonlinear multicommodity flow problems", EJOR vol.121 (2000), pp.532-548.

P. Mahey, A. Hamdi.
"Separable diagonalized multiplier method for decomposing nonlinear programs", Comput. and Applied Math. vol.19,1 (2000).

A. Ouorou, P. Mahey, J.P. Vial.
"A survey of algorithms for convex multicommodity flow problems", Management Science vol.46, 1 (2000), pp.126-147.

H.P.L. Luna, P. Mahey.
"Bounds for global optimization of capacity expansion and flow assignment problems", Operations Research Letters vol.26, 5 (2000), pp.211-216.

L.Leblanc, R.Reddoch, J.Chifflet, P. Mahey.
"Packet routing in telecommunications networks with path and flow restrictions", INFORMS J. on Computing vol.11, 3 (1999), pp.188-197.

B. Garcia, P. Mahey et L. Leblanc.
"Iterative improvement methods for a telecommunications network expansion problem", European J. of Operations Research vol. 110 (1998), pp. 150-165.

P. Mahey, A. Ouorou, L. LeBlanc et J. Chifflet.
"An efficient implementation of the Proximal Decomposition algorithm for routing in Telecommunications networks", Networks vol.31 (1998), pp.227-238.

A. Hamdi, P. Mahey et J.P. Dussault.
"A new decomposition method in nonconvex programming via a separable Aumented Lagrangian", Lecture Notes in Economics and Mathematical Systems 452 (1997), pp.90-104.

P. Mahey, S. Oualibouch et Pham Dinh Tao.
"Proximal decomposition on the graph of a maximal monotone operator", SIAM J. on Optimization vol. 5, 2 (1995), pp. 454-466.

P. Mahey.
"Separable Augmented Lagrangians for the decomposition of large convex programs",Investigacion Operativa, vol. 5 (1995), pp. 1-26.

P. Mahey, R. Saldanha, J.L. Coulomb.
"Moving asymptotes and active set strategy for constrained optimization design in magnetostatic problems", Int. J. Numer. Methods in Engineering vol. 38 (1995), pp. 1021-1030.

P. Mahey et H.P.L. Luna.
"Decomposition and informational decentralization for the computation of economic equilibrium", Approximation and Optimization vol. 8, M. Florenzano, J. Guddat, M. Jimenez, H. Jongen, G. Lagomasino and F. Marcellan eds., Peter Lang European Science Publishers (1995), pp. 494-515.