( en | de | ru )

 

Disambiguation of "Galinier, Philippe"

Author of the publication

copydeleteadd this publication to your clipboard
On Identifying Infeasible Subsets in Constraint Satisfaction Problems.

, , and . IC-AI, page 615-619. CSREA Press, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Philippe Destouches

Philippe Staib

Philippe Kersting

Philippe Bopp

Philippe Dreuw

 

Other publications of authors with the same name

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks., , and . IEEE/ACM Trans. Netw., 24 (1): 137-148 (2016)A tabu search algorithm for the covering design problem., and . J. Heuristics, 17 (6): 659-674 (2011)Restricted swap-based neighborhood search for the minimum connected dominating set problem., , and . Networks, 69 (2): 222-236 (2017)Design evolution metrics for defect prediction in object oriented systems., , , , and . Empirical Software Engineering, 16 (1): 141-175 (2011)Hybrid Evolutionary Algorithms for Graph Coloring., and . J. Comb. Optim., 3 (4): 379-397 (1999)On Identifying Infeasible Subsets in Constraint Satisfaction Problems., , and . IC-AI, page 615-619. CSREA Press, (2010)Tabu Search for Maximal Constraint Satisfaction Problems., and . CP, volume 1330 of Lecture Notes in Computer Science, page 196-208. Springer, (1997)Using local search to speed up filtering algorithms for some NP-hard constraints., , , and . Ann. Oper. Res., 184 (1): 121-135 (2011)A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks., , and . Photonic Netw. Commun., 15 (2): 123-130 (2008)Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures., , and . EvoCOP, volume 6022 of Lecture Notes in Computer Science, page 119-130. Springer, (2010)