P. Galinier

发表

Michel Habib, Christophe Paul, Philippe Galinier, 1995, WG.

Tabu Search for Maximal Constraint Satisfaction Problems

Jin-Kao Hao, Philippe Galinier, P. Galinier, 1997, CP.

Evolution and Search Based Metrics to Improve Defects Prediction

Giuliano Antoniol, Filippo Ricca, Segla Kpodjedo, 2009, 2009 1st International Symposium on Search Based Software Engineering.

Yet another breakout inspired infeasible subset detection in constraint satisfaction problem

P. Galinier, HU Jun, A. Caminada, 2011 .

A tabu search algorithm for the covering design problem

Philippe Galinier, Kamal Fadlaoui, P. Galinier, 2011, J. Heuristics.

A New Formulation of the Set Covering Problem for Metaheuristic Approaches

F. Guibault, P. Galinier, N. Bilal, 2013 .

General Solution Strategies Applicable to Coloring Problems

P. Galinier, Jin-Kao Hao, Jean-Philippe Hamiez, 2012 .

Solving the Progressive Party Problem by Local Search

Jin-Kao Hao, Philippe Galinier, P. Galinier, 1999 .

Improving network applications security: a new heuristic to generate stress testing data

Giuliano Antoniol, Massimiliano Di Penta, Ettore Merlo, 2005, GECCO '05.

An iterated-tabu-search heuristic for a variant of the partial set covering problem

F. Guibault, P. Galinier, N. Bilal, 2014, Journal of Heuristics.

Mining graphs to discover new theorems in mathematics

P. Hansen, P. Galinier, A. Hertz, 2009 .

Improving constrained pattern mining with first-fail-based heuristics

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2011, Data Mining and Knowledge Discovery.

A survey of local search methods for graph coloring

Alain Hertz, Philippe Galinier, P. Galinier, 2004, Comput. Oper. Res..

SyGMA: Reducing Symmetry in Graph Mining

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2007 .

Improving Frequent Subgraph Mining in the Presence of Symmetry

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2007, MLG.

Recent Advances in Graph Vertex Coloring

Jin-Kao Hao, Daniel Cosmin Porumbel, Jean-Philippe Hamiez, 2013, Handbook of Optimization.

Hybrid Evolutionary Algorithms for Graph Coloring

Jin-Kao Hao, Philippe Galinier, P. Galinier, 1999, J. Comb. Optim..

Automated generation of conjectures on forbidden subgraph characterization

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2007, Discret. Appl. Math..

An efficient memetic algorithm for the graph partitioning problem

Philippe Galinier, Zied Boujbel, Michael Coutinho Fernandes, 2011, Ann. Oper. Res..

An adaptive memory algorithm for the k-coloring problem

Alain Hertz, Nicolas Zufferey, Philippe Galinier, 2003, Discret. Appl. Math..

Efficient algorithms for finding critical subgraphs

Alain Hertz, Christian Desrosiers, Philippe Galinier, 2004, Discret. Appl. Math..

Solution techniques for the Large Set Covering Problem

Alain Hertz, Philippe Galinier, P. Galinier, 2003, Discret. Appl. Math..

Detecting buffer overflow via automatic test input data generation

Giuliano Antoniol, Ettore Merlo, Philippe Galinier, 2008, Comput. Oper. Res..

TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm

Yann-Gaël Guéhéneuc, Giuliano Antoniol, Massimiliano Di Penta, 2012, 2012 19th Working Conference on Reverse Engineering.

A Fast Algorithm to Locate Concepts in Execution Traces

Yann-Gaël Guéhéneuc, Giuliano Antoniol, Massimiliano Di Penta, 2011, SSBSE.

HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care

Gilles Pesant, Philippe Galinier, Stéphane Bourdais, 2003, CP.

Applying local search to the feedback vertex set problem

Philippe Galinier, Eunice Adjarath Lemamou, Mohamed Wassim Bouzidi, 2013, Journal of Heuristics.

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

Steven Chamberland, Philippe Galinier, Eunice Adjarath Lemamou, 2016, IEEE/ACM Transactions on Networking.

An iterated-tabu-search heuristic for a variant of the partial set covering problem

François Guibault, Philippe Galinier, Nehme Bilal, 2014, Journal of Heuristics.

Applying local search to the feedback vertex set problem

P. Galinier, E. Lemamou, Mohamed Wassim Bouzidi, 2013, Journal of Heuristics.

Sub-graph Mining: Identifying Micro-architectures in Evolving Object-Oriented Software

Yann-Gaël Guéhéneuc, Giuliano Antoniol, Segla Kpodjedo, 2011, 2011 15th European Conference on Software Maintenance and Reengineering.

Using local search to speed up filtering algorithms for some NP-hard constraints

Alain Hertz, Gilles Pesant, Philippe Galinier, 2010, Ann. Oper. Res..

Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints

Alain Hertz, Gilles Pesant, Philippe Galinier, 2008, CPAIOR.

Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla?

Giuliano Antoniol, Filippo Ricca, Segla Kpodjedo, 2009, 2009 13th European Conference on Software Maintenance and Reengineering.

Tabu Search for Frequency Assignment in Mobile Radio Networks

Jin-Kao Hao, Raphaël Dorne, Philippe Galinier, 1998, J. Heuristics.