Membre collaborateur
 
Philippe Galinier
Polytechnique Montréal, Département de génie informatique et génie logiciel
Bureau:
Polytechnique Montréal, Pavillon principal, bureau M-3416
514 340-4711 # 2228
Dernières publications
Wu X., Lu Z., Galinier Philippe, Restricted swap-based neighborhood search for the minimum connected dominating set problem, NETWORKS - An International Journal, 69(2), 222-236, 2017

Lemamou E., Galinier Philippe, Chamberland Steven, A hybrid iterated local search algorithm for the global planning problem of survivable 4G wireless networks, IEEE/ACM Transactions on Networking, 24(1), 137-148, 2016

Bilal N., Galinier Philippe, Guibault F., An iterated-tabu-search heuristic for a variant of the partial set covering problem, Journal of Heuristics, 20(2), 143-164, 2014

Bilal N., Galinier Philippe, Guibault F., Automated generation of conjectures on forbidden subgraph characterization, Discrete Applied Mathematics, 162, 177-194, 2014

Kpodjedo S., Galinier Philippe, Antoniol G., Using local similarity measures to efficiently address approximate graph matching, Discrete Applied Mathematics, 164, 161-177, 2014

Bilal N., Galinier Philippe, Guibault F., A new formulation of the set covering problem for metaheuristic approaches, ISRN Operations Research, en ligne en 2013, dx.doi.org/10.1155/2013/203032, 2013

En savoir plus »»

Bureau de Québec

Pavillon Palasis-Prince, bureau 2415
2325, rue de la Terrasse
Université Laval
Québec (QC) G1V 0A6
Canada

Téléphone: 418 656-2073

Télécopieur: 418 656-2624

Courriel: 

Bureau de Montréal

Pavillon André Aisenstadt, bureau 3520
2920, chemin de la Tour
Université de Montréal
Montréal (QC) H3T 1J4
Canada

Téléphone: 514 343-7575

Courriel: 

Dernière mise à jour: 2024-10-15