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