MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Philippe Galinier" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 5 documents found, showing 1 through 5.
ATOM RSS
  • Tabu Search for Maximal Constraint Satisfaction Problems  
  • by Philippe Galinier, Jin-kao Hao — 1997 — Proceedings of Third International Conference on Principles and Practice of Constraint Programming (CP97
  • …. This paper presents a Tabu Search (TS) algorithm for solving maximal constraint satisfaction problems. The algorithm was tested on a wide range of random instances (up to 500 variables and 30 values) . Comparisons were carried out with a min-conflicts+random-walk (MCRW) algorithm. Empirical eviden…
  • Cited by 26 (3 self)Add To MetaCart
  • Hybrid Evolutionary Algorithms for Graph Coloring  
  • by Philippe Galinier, Jin-kao Hao — 1998
  • …A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators …
  • Cited by 61 (6 self)Add To MetaCart
  • Tabu Search for Frequency Assignment in Mobile Radio Networks  
  • by Jin-kao Hao, Raphaël Dorne, Philippe Galinier — 1998 — Journal of Heuristics
  • …The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electro-magnetic interference due to the re-use of frequencies. This problem, known to be NP-hard, is of great im…
  • Cited by 9 (3 self)Add To MetaCart
  • Chordal Graphs and Their Clique Graphs  
  • by Philippe Galinier, Michel Habib, Christophe Paul — 1995 — In WG ’95
  • …. In the first part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied. A new greedy algorithm that general…
  • Cited by 8 (2 self)Add To MetaCart
  • Solving The Progressive Party Problem By Local Search  
  • by Philippe Galinier, Jin-kao Hao, Parc Scientifique, Georges Besse, F- Nimes — 1998 — Osman and C. Roucairol (Eds.), Kluwer Academic Publishers, Chapter
  • …: The Progressive Party Problem (PPP) is a complex, constrained combinatorial optimization problem. The goal of the problem consists of finding assignments of resources to variables for a given number of time periods while satisfying a set of multiple constraints. So far, two quite di#erent approac…
  • Cited by 3 (0 self)Add To MetaCart
Help! Showing 1 through 5.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB