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