Nombre de documents

16

CV de Philippe Mahey


Article dans une revue13 documents

  • Arnaud Lenoir, Philippe Mahey. ACCELERATING CONVERGENCE OF A CLASS OF SPLITTING ALGORITHMS WITH ITERATIVE FOLDINGS. Acta Mathematica Vietnamica, Vietnam Academy of Science and Technology, 2009, 49, pp.49 - 65. <hal-01386565>
  • Bénédicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey. Simple Bounds and Greedy Algorithms for Decomposing a Flow into a Minimal Set of Paths. European Journal of Operational Research, Elsevier, 2008, 185 (3), pp.1390-1401. <10.1016/j.ejor.2006.05.043>. <hal-01185177>
  • Philippe Mahey, M.C. De Souza. LOCAL OPTIMALITY CONDITIONS FOR MULTICOMMODITY FLOW PROBLEMS WITH SEPARABLE PIECEWISE CONVEX COSTS. Operations Research Letters, Elsevier, 2006, 14 p. <hal-00125824>
  • Philippe Mahey, T.Q. Phong, H.P. Luna. SEPARABLE CONVEXIFICATION AND DCA TECHNIQUES FOR CAPACITY AND FLOW ASSIGNMENT. RAIRO - Operations Research, EDP Sciences, 2006, 35, pp.269-281. <hal-00125822>
  • Philippe Mahey, M. Souza. MULTICOMMODITY FLOWS WITH A BOUNDED NUMBER OF PATHS : A FLOW DEVIATION APPROACH. Networks, Wiley, 2006, 8 p. <hal-00125831>
  • B. Vatinlen, F. Chauvet, P. Chretienne, Philippe Mahey. SIMPLE BOUNDS AND GREEDY ALGORITHMS FOR DECOMPOSING A FLOW INTO A MINIMAL SET OF PATHS. EJOR, 2006, 9 p. <hal-00125839>
  • J.P. Dussault (o. Gueye), Philippe Mahey. Separable augmented lagrangean algorithm with multidimensional scaling for monotropic programmaing. JOTA, 2005, 127,2, 11 p. <hal-00107888>
  • Bruno Bachelet, Philippe Mahey. Minimum convex piecewise linear cost tension problems on quasi k-series-parallel graphs. Quarterly Journal of Operations Research, 2004, 2-4, pp.275-291. <hal-00107057>
  • Bruno Bachelet, Philippe Mahey. Minimum convex cost tension problems on serie-parallel graphs. RAIRO - Operations Research, EDP Sciences, 2003, 37-4, pp.221-234. <hal-00107129>
  • C. Ribeiro, Philippe Mahey. OPTIMAL ROUTING FOR MULTISERVICE COMMUNICATION NETWORKS. OR/MS TODAY, 2002, 9,3, pp.32-35. <hal-00125836>
  • A. Ouorou, H. Luna, Philippe Mahey. MULTICOMMODITY NETWORK EXPANSION UNDER ELASTIC DEMANDS. Optimization and Engineering, Springer Verlag, 2001, 2, pp.277-292. <hal-00125832>
  • Philippe Mahey, A. Benchakroun, F. Boyer. CAPACITY AND FLOW ASSIGNMENT OF DATA NETWORKS BY GENERALIZED BENDERS DECOMPOSITION. Journal of Global Optimization, Springer Verlag, 2001, 20,2, pp.173-193. <hal-00125817>
  • H.P. Luna, C.D. Randazzo, Philippe Mahey. BENDERS DECOMPOSITION FOR LOCAL ACCESS NETWORK DESIGH WITH TWO TECHNOLOGIES. DISCRETE MATH. AND THEORICAL COMPUTER SCIENCE, 2001, 4, pp.235-246. <hal-00125813>

HDR1 document

  • Philippe Mahey. Méthodes de décomposition pour la programmation mathématique. Modélisation et simulation. Institut National Polytechnique de Grenoble - INPG, 1990. <tel-00337842>

Thèse1 document

  • Philippe Mahey. Étude de la planification d'une unité de fabrication en vue de sa gestion intégrée. Automatique / Robotique. Université Paul Sabatier - Toulouse III, 1978. Français. <tel-00178418>

Rapport1 document

  • Arnaud Lenoir, Philippe Mahey. Accelerating convergence of a Separable Augmented Lagrangian Algorithm. 2007. <hal-00678361>