Graph coloring by multiagent fusion search
From MaRDI portal
Publication:1037448
DOI10.1007/s10878-008-9140-6zbMath1198.05071OpenAlexW2093265175MaRDI QIDQ1037448
Publication date: 16 November 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9140-6
Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Agent technology and artificial intelligence (68T42)
Related Items
Coloring large graphs based on independent set extraction ⋮ Improving the extraction and expansion method for large graph coloring ⋮ AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- A fast tabu search algorithm for the permutation flow-shop problem
- A new adaptive multi-start technique for combinatorial global optimizations
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Two novel evolutionary formulations of the graph coloring problem
- Graph coloring for air traffic flow management
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- An ant-based algorithm for coloring graphs
- An adaptive memory algorithm for the \(k\)-coloring problem
- A survey of local search methods for graph coloring
- Combinatorial Landscapes
- A Large Neighborhood Search Heuristic for Graph Coloring
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- A Column Generation Approach for Graph Coloring
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- On the hardness of approximating the chromatic number
- Algorithm portfolios
- Multi-agent oriented constraint satisfaction
- Local search characteristics of incomplete SAT procedures
