A metaheuristic approach for the vertex coloring problem
From MaRDI portal
Publication:2901013
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)
Recommendations
Cited in
(50)- The vertex coloring problem and its generalizations
- An evolutionary approach for bandwidth multicoloring problems
- An adaptive memory algorithm for the \(k\)-coloring problem
- A Wide Branching Strategy for the Graph Coloring Problem
- scientific article; zbMATH DE number 6697958 (Why is no real title available?)
- An extraction and expansion approach for graph coloring
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- An effective heuristic algorithm for sum coloring of graphs
- A heuristic for the minimum cost chromatic partition problem
- A survey on vertex coloring problems
- Heuristics for a project management problem with incompatibility and assignment costs
- Coloring large graphs based on independent set extraction
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A new approach to the vertex coloring problem
- Variable space search for graph coloring
- Meta-heuristics and artificial intelligence
- An exact approach for the vertex coloring problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- A search space ``cartography for guiding graph coloring heuristics
- A two-level metaheuristic for the all colors shortest path problem
- Optimization by ant algorithms: possible roles for an individual ant
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- An exact algorithm for parallel machine scheduling with conflicts
- Quantum annealing of the graph coloring problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Simple decentralized graph coloring
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- Uncertain vertex coloring problem
- A memetic algorithm for graph coloring
- A massively parallel evolutionary algorithm for the partial Latin square extension problem
- Improving the extraction and expansion method for large graph coloring
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
- Consistent neighborhood search for combinatorial optimization
- Graph coloring models and metaheuristics for packing applications
- Hybrid evolutionary algorithm for the b-chromatic number
- Weighted vertices optimizer (WVO): a novel metaheuristic optimization algorithm
- Exact and approximate methods for the score-constrained packing problem
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- Models and heuristic algorithms for a weighted vertex coloring problem
- An exact algorithm with learning for the graph coloring problem
- A memetic algorithm for the minimum sum coloring problem
- Informed reactive tabu search for graph coloring
- A metaheuristic framework for nonlinear capacitated covering problems
- Recycling solutions for vertex coloring heuristics
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
This page was built for publication: A metaheuristic approach for the vertex coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901013)
