Heuristic algorithms and learning techniques: applications to the graph coloring problem

اسناد مشابه

• An exact algorithm with learning for the graph coloring problem

  سند علمی۲۰۱۴Computers & ORZhaoyang Zhou, Chu Min Li, Chong Huang, Ruchu Xu

  Given an undirected graph G=(V ,E), the Graph Coloring Problem (GCP) consists in assigning a color to each vertex of the graph G in such a way that any two adjacent vertices are assigned different colors, and the number of different colors used is minimized. State-of-the-art algo

• Genetic Algorithm Applied to the Graph Coloring Problem

  سند علمی۲۰۱۲MAICSMusa Hindi, Roman V. Yampolskiy

  In this paper we present a hybrid technique that applies a genetic algorithm followed by wisdom of artificial crowds approach to solving the graph-coloring problem. The genetic algorithm described here utilizes more than one parent selection and mutation methods depending on the

• Tree Search Methods versus Genetic Algorithms for Over-Constrained Graph Coloring Problems

  سند علمی۲۰۰۱Blaise Madeline, Bertrand Neveu

  Constraint satisfaction problems (CSP) are widely studied in a large area of computer sciences, and many problems can be treated as CSPs. Furthermore, many solving methods exist such as complete methods, local search (for example tabu search) and genetic algorithms (GA) [4]. The

• A complete algorithm to solve the graph-coloring problem

  سند علمی۲۰۰۹LA-NMRHuberto Ayanegui-Santiago, Alberto Chávez-Aragón

  The Graph k-Colorability Problem (GCP) is a well known NP-hard problem which consist in finding the k minimum number of colors to paint the vertices of a graph in such a way that any two vertices joined by an edge have always different colors. Many years ago, Simulated Annealing

• Decision Fusion of Combinatorial Optimization Algorithms for Solving the Graph Coloring Problem

  سند علمی۲۰۰۷IC-AIPraveen Nuthulapati, Ajay K. Katangur

  The graph coloring problem is a practical method of representing many real world problems including time scheduling, frequency assignment, register allocation, and circuit board testing. The most important fact that makes graph coloring exciting is that finding the minimum number

• A branch-and-price algorithm for the robust graph coloring problem

  سند علمی۲۰۱۴Discrete Applied MathematicsClaudia Archetti, Nicola Bianchessi, Alain Hertz

  Given a graph G, an integer k, and a cost cuv associated with all pairs uv of non-adjacent vertices in G, the robust graph coloring problem is to assign a color in {1, · · · , k} to every vertex of G so that no edge has both endpoints with the same color, and the total cost of th