Blaise Madeline, Bertrand Neveu  Home/Search
Context
Related
| 143.129.203.3/eume...IC2001_731_736.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: 143.129.203.3/eum...allpapers.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper is to show that for some graph coloring problems, especially over-constrained, using genetic algorithms can be advantageous. In the first part, we show the results of using GA versus tree search methods, to find the minimal number of conflicts for coloring the n-queen problem (from Dimacs Challenge) with less colors than necessary. In the second part we introduce two graphs extracted from the wavelength division multiplexing (WDM) problem in all-optical networks [1], and we show the... (Update)
Active bibliography (related documents): More All
0.1: New Low Cost and Undedicated Genetic Operators. - Madeline (2002) (Correct)
0.1: Theoretical and Numerical Constraint-Handling Techniques used.. - Coello (2002) (Correct)
0.1: A Survey of Constraint Handling Techniques used with Evolutionary .. - Coello (1999) (Correct)
Similar documents based on text: More All
0.2: Houria II: A Solver For Hierarchical Constraint Systems.. - Bouzoubaa, Neveu, Hasle (1995) (Correct)
0.2: A Non-diffident Combinatorial Optimization Algorithm - Trombettoni, Neveu.. (Correct)
0.2: Using Graph Decomposition for Solving Continuous CSPs - Bliek, Neveu, Trombettoni (1998) (Correct)
BibTeX entry: (Update)
@inproceedings{ madeline-neveu01:mic,
author = {B.~Madeline and B.~Neveu},
title = {Tree Search Methods versus Genetic Algorithms for Over-Constrained Graph Coloring Problems},
booktitle = {Proc. of Metaheuristic International Conference},
pages = {731-736},
year = {2001},
volume = {II},
address = {Porto, Portugal},
url = {citeseer.ist.psu.edu/madeline01tree.html} }
Citations (may not include all citations):311 Partial constraint satisfaction - Freuder, Wallace - 1992
210 Minimizing conflict: a heuristic repair method for constrain.. - Minton, Johnston et al. - 1992
134 Limited discrepancy search - Harvey, Ginsberg - 1995 DBLP
60 Graph problems arising from wavelength-routing in all- optic.. - Beauquier, Bermond et al. - 1997
34 MAC and combined heuristics: two reasons to forsake FC - Bessiere, Regin - 1996
31 Hybrid evolutionary algorithms for graph coloring - Galinier, Hao - 1999 DBLP
20 Adaptive penalties for evolutionary graph coloring - Eiben, van der Hauw - 1997 ACM DBLP
12 GA-easy and GA-hard constraint satisfaction problems - Eiben, Raue et al. - 1994 ACM DBLP
1 une bibliotheque de classes C++ pour le developpement d'oper.. (context) - Didierjean
1 A network-based adaptive evolutionary algorithm for constrai.. (context) - Ri - 1998
1 coloring and satifiability (context) - Johnson, Trick - 1993
Documents on the same site (http://143.129.203.3/eume/MIC2001/allpapers.php): More
A Look-Ahead Addition to the Ant Colony Optimization.. - Gagne, Gravel, Price (2001) (Correct)
Heuristics for Large Strip Packing Problems with Guillotine.. - Valenzuela, Wang (2001) (Correct)
A Local Search Approach to the Resource Constrained Project.. - Nonobe, Ibaraki (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC