Philippe Mahey
Possui uma Habilitation à Diriger les Recherches - Institut National Polytechnique de Grenoble (1990) e doutorado - Université Toulouse III Paul Sabatier (1978). Jà foi professor associado do Departamento de Engenharia Elétrica da PUC do Rio de Janeiro (1978-1988). Atualmente é professor titular - Université Blaise Pascal - Clermont-Ferrand e professor visitante da Universidade Federal de Minas Gerais. Tem experiência na área de Ciência da Computação, com ênfase em Pesquisa Operacional, atuando principalmente nos seguintes temas: programaçao matematica (decomposition methods, network design, multicommodity flows, combinatorial optimization e planning).
Informações coletadas do Lattes em 10/11/2022
Acadêmico
Formação acadêmica
Doutorado em Habilitation à Diriger les Recherches
1989 - 1990
Institut National Polytechnique de Grenoble
Título: Méthodes de décomposition en Programmation Mathématique
Orientador: Jean Fonlupt
Palavras-chave: decomposition methods.Grande área: Ciências Exatas e da Terra
Doutorado
1975 - 1978
Université Toulouse III Paul Sabatier
Título: Planification des systèmes de production à moyen terme
Orientador: Francois Roubellat
Grande área: Ciências Exatas e da Terra
Idiomas
Inglês
Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.
Português
Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.
Francês
Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.
Áreas de atuação
Grande área: Ciências Exatas e da Terra / Área: Ciência da Computação.
Grande área: Ciências Exatas e da Terra / Área: Matemática / Subárea: otimizacao.
Grande área: Ciências Exatas e da Terra / Área: Ciência da Computação / Subárea: Pesquisa Operacional.
Orientou
Optimizing the delivery of video streams over under-provisioned networks; 2016; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand,; Coorientador: Philippe Mahey;
Fixed-cardinality linear ordering problems; 2014; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Centre National de la Recherche Scientifique; Coorientador: Philippe Mahey;
'Planification optimale discrète et continue : un joueur de billard optimisé; 2012; Tese (Doutorado em Doctorat en Mathématiques Appliquées) - Université de Sherbrooke,; Coorientador: Philippe Mahey;
'Modèles et métaheuristiques pour le problème de routage et allocation de longueurs d'ondes dans les réseaux optiques; 2011; Tese (Doutorado em Engenharia de Produção) - Universidade Federal de Minas Gerais, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Coorientador: Philippe Mahey;
Modèles et algorithmes pour la planification de production à moyen terme en environnement incertain; 2008; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Ministère de la Recherche et Technologies; Orientador: Philippe Mahey;
Inférence des accords économiques et des politiques de routage dans l?Internet; 2007; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Ministère de la Recherche et Technologies; Orientador: Philippe Mahey;
Conception de réseaux haut débit sous contraintes de sécurisation; 2007; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Ministère de la Recherche et Technologies; Orientador: Philippe Mahey;
Planification et conception topologique des réseaux de communications cellulaires; 2005; Tese (Doutorado em Doctorat en Mathématiques Appliquées) - Université de Sherbrooke,; Coorientador: Philippe Mahey;
Optimisation de réseaux multiprotocoles avec encapsulation; 2004; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand,; Orientador: Philippe Mahey;
Modélisation et optimisation de problèmes de synchronisation dans les documents hypermedia; 2003; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Ministère de la Recherche et Technologies; Orientador: Philippe Mahey;
Contribution à l?étude du Lagrangien augmenté séparable ; application au problème de routage des données dans les réseaux de communications; 2003; Tese (Doutorado em Doctorat en Mathématiques Appliquées) - Université de Sherbrooke,; Coorientador: Philippe Mahey;
Modèles continus et algorithmes de résolution pour les problèmes de routage et d?expansion de capacités des réseaux de communications; 2002; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand,; Orientador: Philippe Mahey;
Applications de la technologie de groupes et de la relaxation lagrangienne au problème de job-shop; 2000; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Orientador: Philippe Mahey;
Méthodes de lagrangiens augmentés en programmation convexe et non convexe ; applications à la décomposition; 1998; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand,; Orientador: Philippe Mahey;
Une proposition d?intégration de la planification et l?ordonnnancement de productio; 1998; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Conselho Nacional de Desenvolvimento Científico e Tecnológico; Orientador: Philippe Mahey;
Conception et routage des réseaux de télécommunications; 1997; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand,; Orientador: Philippe Mahey;
Une approche générique des méthodes par amélioration itérative; 1995; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand, Ministère de la Recherche et Technologies; Coorientador: Philippe Mahey;
Décomposition proximale des problèmes de multiflot à critère convexe; 1995; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand,; Orientador: Philippe Mahey;
Application des méthodes de décomposition à la résolution de quelques problèmes combinatoires; 1994; Tese (Doutorado em Ecole Doctorale SPI) - Université Blaise Pascal - Clermont-Ferrand,; Coorientador: Philippe Mahey;
Planification et répartition des wagons fret SNCF : Approche globale et par décomposition; 1993; Tese (Doutorado em Doctorat en Mathématiques Appliquées) - Institut National Polytechnique de Grenoble,; Orientador: Philippe Mahey;
Analyse numérique des méthodes proximales : décomposition et parallélisation; 1992; Tese (Doutorado em Doctorat en Mathématiques Appliquées) - Institut National Polytechnique de Grenoble,; Orientador: Philippe Mahey;
Contribuição ao estudo da Programação DC (Diferença de duas funções convexas); 1990; Tese (Doutorado em Doutorado em Engenharia Elétrica - Pontifícia Universidade Católica, RJ) - Pontifícia Universidade Católica do Rio de Janeiro,; Orientador: Philippe Mahey;
Produções bibliográficas
-
LENOIR, ARNAUD ; MAHEY, PHILIPPE . A survey on operator splitting and decomposition of convex programs. RECHERCHE OPÉRATIONNELLE , v. 51, p. 17-41, 2017.
-
MAHEY, PHILIPPE ; KOKO, JONAS ; LENOIR, ARNAUD . Decomposition methods for a spatial model for long-term energy pricing problem. MATHEMATICAL METHODS OF OPERATIONS RESEARCH , v. 85, p. 137-153, 2017.
-
DUHAMEL, CHRISTOPHE ; MAHEY, PHILIPPE ; MARTINS, ALEXANDRE X. ; SALDANHA, RODNEY R. ; DE SOUZA, MAURICIO C. . Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. 4OR , v. 14, p. 201-220, 2016.
-
MORAIS, VINICIUS ; DA CUNHA, ALEXANDRE SALLES ; MAHEY, PHILIPPE . A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game. ELECTRONIC NOTES IN DISCRETE MATHEMATICS , v. 52, p. 309-316, 2016.
-
GELAREH, SHAHIN ; NEAMATIAN MONEMI, RAHIMEH ; MAHEY, PHILIPPE ; MACULAN, NELSON ; PISINGER, DAVID . Single string planning problem arising in liner shipping industries: A heuristic approach. Computers & Operations Research , v. 40, p. 2357-2373, 2013.
-
FERREIRA, RICARDO POLEY MARTINS ; LUNA, HENRIQUE PACCA LOUREIRO ; MAHEY, PHILIPPE ; SOUZA, MAURICIO CARDOSO DE . Global optimization of capacity expansion and flow assignment in multicommodity networks. Pesquisa Operacional (Impresso) , v. 33, p. 217-234, 2013.
-
LANDRY, JEAN-FRANCOIS ; DUSSAULT, JEAN-PIERRE ; MAHEY, PHILIPPE . A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards. IEEE Transactions on Computational Intelligence and AI in Games , v. 5, p. 325-336, 2013.
-
MARTINS, ALEXANDRE X. ; DUHAMEL, CHRISTOPHE ; MAHEY, PHILIPPE ; SALDANHA, RODNEY R. ; DE SOUZA, MAURICIO C. . Variable neighborhood descent with iterated local search for routing and wavelength assignment. Computers & Operations Research , v. 39, p. 2133-2141, 2012.
-
LANDRY, JEAN-FRANÇOIS ; DUSSAULT, JEAN-PIERRE ; MAHEY, PHILIPPE . A robust controller for a two-layered approach applied to the game of billiards. Entertainment Computing , v. 3, p. 59-70, 2012.
-
MARTINS, A. X. ; DUHAMEL, CHRISTOPHE ; DE SOUZA, M.C. ; MAHEY, P. ; SALDANHA, RODNEY R. . A VND-ILS heuristic to solve the RWA problem. Lecture Notes in Computer Science , v. 6701, p. 577-582, 2011.
-
TRUFFOT, JÉRÔME ; DUHAMEL, CHRISTOPHE ; MAHEY, PHILIPPE . k-Splittable delay constrained routing problem: A branch-and-price approach. Networks (New York, N.Y. Print) , v. 55, p. 33-45, 2010.
-
MAHEY, P. ; LENOIR, A. . Accelerating a class of splitting algorithms by iterative folding. Acta Mathematica Vietnamica , v. 39, p. 49-65, 2009.
-
DE SOUZA, MAURICIO C. ; MAHEY, PHILIPPE ; GENDRON, BERNARD . Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. Networks (New York Online) , v. 51, p. 133-141, 2008.
-
VATINLEN, B. ; CHAUVET, F. ; CHRÉTIENNE, P. ; MAHEY, P. . Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths. European Journal of Operational Research , v. 185, p. 1390-1401, 2008.
-
MAHEY, P. ; DE SOUZA, M.C. . Local optimality conditions for multicommodity flow problems with separable piecewise convex costs. Operations Research Letters , v. 35, p. 221-226, 2007.
-
BACHELET, BRUNO ; MAHEY, PHILIPPE ; RODRIGUES, ROGÉRIO ; SOARES, LUIZ FERNANDO . Elastic time computation in QoS-driven hypermedia presentations. Multimedia Systems (Online) , v. 12, p. 461-478, 2007.
-
DUHAMEL, CHRISTOPHE ; MAHEY, PHILIPPE . Multicommodity flow problems with a bounded number of paths: A flow deviation approach. Networks (New York Online) , v. 49, p. 80-89, 2007.
-
GUÈYE, O. M. ; DUSSAULT, J. -P. ; MAHEY, P. . Separable Augmented Lagrangian Algorithm with Multidimensional Scaling for Monotropic Programming. Journal of Optimization Theory and Applications (Dordrecht. Online) , v. 127, p. 329-345, 2005.
-
BACHELET, BRUNO ; MAHEY, PHILIPPE . Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. 4OR , v. 2, p. 275-291, 2004.
-
BACHELET, BRUNO ; MAHEY, PHILIPPE . Minimum convex-cost tension problems on series-parallel graphs. Recherche Opérationnelle , v. 37, p. 221-234, 2003.
-
MAHEY, P. ; RIBEIRO, C. . Optimal routing for multiservice communication networks. OR/MS Today (Baltimore) , v. 29, p. 32-35, 2002.
-
MAHEY, P. ; BENCHAKROUN, A. ; BOYER, F. . Capacity and flow assignment of data networks by generalized Benders decomposition. Journal of Global Optimization , v. 20, p. 173-193, 2001.
-
MAHEY, P. ; PHONG, THAI Q. ; LUNA, H. P.L. . Separable convexification and DCA techniques for capacity and flow assignment problems. Recherche Opérationnelle , v. 35, p. 269-281, 2001.
-
MAHEY, P. ; LUNA, H. P. ; RANDAZZO, C. . Benders decomposition for local access network design with two technologies. Discrete Mathematics and Theoretical Computer Science (Online) , v. 4, p. 235-246, 2001.
-
OUOROU, ADAM ; LUNA, HENRIGUE PACCA LOUREIRO ; MAHEY, PHILIPPE . Multicommodity network expansion under elastic demands. Optimization and Engineering (Print) , v. 2, p. 277-292, 2001.
-
OUOROU, A. ; MAHEY, P. ; VIAL, J.-PH. . A Survey of Algorithms for Convex Multicommodity Flow Problems. Management Science , v. 46, p. 126-147, 2000.
-
LUNA, H.P.L. ; MAHEY, P. . Bounds for global optimization of capacity expansion and flow assignment problems. Operations Research Letters , v. 26, p. 211-216, 2000.
-
OUOROU, A. ; MAHEY, P. . A minimum mean cycle cancelling method for nonlinear multicommodity flow problems. European Journal of Operational Research , v. 121, p. 532-548, 2000.
-
MAHEY, P. ; HAMDI, A. . Separable diagonalized multiplier method for decomposing nonlinear programs. Computational & Applied Mathematics , v. 19, p. 1-29, 2000.
-
MAHEY, P. ; BENCHAKROUN, A. ; HAMDI, A. ; DUSSAULT, J. -P. . Adaptive scaling and convergence rates of a separable augmented lagrangian algorithm. Lecture Notes in Economics and Mathematical Systems , v. 481, p. 278-287, 2000.
-
LEBLANC, LARRY J. ; CHIFFLET, JEROME ; MAHEY, PHILIPPE . Packet Routing in Telecommunication Networks with Path and Flow Restrictions. INFORMS Journal on Computing (Online) , v. 11, p. 188-197, 1999.
-
MAHEY, P. ; OUOROU, A. ; LEBLANC, L. ; CHIFFLET, J. . A new proximal decomposition algorithm for routing in telecommunication networks. Networks (New York Online) , v. 31, p. 227-238, 1998.
-
GARCIA, BRUNO-LAURENT ; MAHEY, PHILIPPE ; LEBLANC, LARRY J. . Iterative improvement methods for a multiperiod network design problem. European Journal of Operational Research , v. 110, p. 150-165, 1998.
-
MAHEY, P. ; DUSSAULT, J. -P. ; HAMDI, A. . A new decomposition method in nonconvex programming via a separable Augmented Lagrangian. Lecture Notes in Economics and Mathematical Systems , v. 452, p. 90-104, 1997.
-
MAHEY, PHILIPPE ; OUALIBOUCH, SAID ; TAO, PHAM DINH . Proximal Decomposition on the Graph of a Maximal Monotone Operator. SIAM Journal on Optimization , v. 5, p. 454-466, 1995.
-
MAHEY, P. ; SALDANHA, R. R. ; COULOMB, J. L. . Moving asymptotes and active set strategy for constrained optimization design in magnetostatic problems. International Journal for Numerical Methods in Engineering (Online) , v. 38, p. 1021-1030, 1995.
-
MAHEY, P. . Separable Augmented Lagrangians for the decomposition of large convex programs. investigation operativa , v. 5, p. 1-26, 1995.
-
MAHEY, P. ; CHIFFLET, J. ; REYNIER, V. . Proximal decomposition for multi-commodity flow problems with convex costs. Telecommunications Systems , v. 3, p. 1-10, 1994.
-
MAHEY, P. ; TAO, P. D. . Partial regularization of the sum of two maximal monotone operators. Modélisation Mathématique et Analyse Numérique (Imprimé) , v. 27, p. 375-392, 1993.
-
MAHEY, P. ; LASSERRE, J. . Using linear programming in Petri nets analysis. RAIRO. Recherche Opérationnelle , v. 23, p. 43-50, 1989.
-
MAHEY, P. . Méthodes de décomposition et décentralisation en programmation linéaire. RAIRO. Recherche Opérationnelle , v. 20, p. 287-306, 1986.
-
MAHEY, P. . Decomposition of large-scale linear programs by subgradient optimization. Matemática Aplicada e Computacional (Cessou em 1997. Cont. ISSN 1807-0302 Computational & Applied Mathematics) , v. 1, p. 121-134, 1982.
-
MAHEY, PHILIPPE . Programaçao Nao Linear. 1. ed. Rio de Janeiro: Campus, 1987.
-
LISSER, A. ; MAHEY, PHILIPPE . Multicommodity flow problems in telecommunications networks. In: Mauricio G.C. Resende; Panos M. Pardalos. (Org.). Handbook of Optimisation in Telecommunications. 1ed.: Springer US, 2006, v. , p. 241-267.
-
MAHEY, PHILIPPE . Decomposition methods in mathematical programming. In: Pardalos P., Resende M.G.C.. (Org.). Handbook of Applied Optimization. 1ed.Oxford: Oxford University Press, 2002, v. , p. 780-.
Histórico profissional
Endereço profissional
-
Université Blaise Pascal - Clermont-Ferrand. , ISIMA - BP 10125, 63173 - Volvic, - França, Telefone: (0033) 473405007
Experiência profissional
1993 - Atual
Université Blaise Pascal - Clermont-FerrandVínculo: Empregado, Enquadramento Funcional: Professor titular
1978 - 1988
Pontifícia Universidade Católica do Rio de Janeiro, PUC-RioVínculo: Servidor Público, Enquadramento Funcional: Professor Associado, Carga horária: 40, Regime: Dedicação exclusiva.
1988 - 1993
Université Joseph Fourier - Grenoble IVínculo: Servidor Público, Enquadramento Funcional: Maître de Conférences, Regime: Dedicação exclusiva.
2015 - Atual
Universidade Federal de Minas GeraisVínculo: Professor Visitante, Enquadramento Funcional: Professor
Outras informações:
Professor Visitante Especial (CNPq)
Criando um monitoramento
Nossos robôs irão buscar nos nossos bancos de dados todos os processos de Philippe Mahey e sempre que o nome aparecer em publicações dos Diários Oficiais, avisaremos por e-mail e pelo painel do usuário
Criando um monitoramento
Nossos robôs irão buscar nos nossos bancos de dados todas as movimentações desse processo e sempre que o processo aparecer em publicações dos Diários Oficiais e nos Tribunais, avisaremos por e-mail e pelo painel do usuário
Confirma a exclusão?