New variable neighborhood search method for minimum sum coloring problem on simple graphs
From MaRDI portal
Publication:3389565
Recommendations
- A general variable neighborhood search approach for the minimum load coloring problem
- A variable neighborhood search for graph coloring.
- A Large Neighborhood Search Heuristic for Graph Coloring
- Approximation results for the minimum graph coloring problem
- A branch-and-price algorithm for the minimum sum coloring problem
- A new heuristic for the sum coloring problem
- A tabu search approach for the sum coloring problem
- New heuristics for the vertex coloring problem based on semidefinite programming
- Variable space search for graph coloring
Cites work
- scientific article; zbMATH DE number 4154469 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- A graph-based hyper-heuristic for educational timetabling problems
- A memetic algorithm for the minimum sum coloring problem
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- A tabu search approach for the sum coloring problem
- An effective heuristic algorithm for sum coloring of graphs
- Bag rationalisation for a food manufacturer
- Improving heuristics for the frequency assignment problem
- Lower bounds for the minimal sum coloring problem
- Minimal coloring and strength of graphs
- Tabular graphs and chromatic sum
- The chromatic sum of a graph: history and recent developments
- Tight bounds on the chromatic sum of a connected graph
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
Cited in
(7)- A new heuristic for the sum coloring problem
- A general variable neighborhood search approach for the minimum load coloring problem
- On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application
- Variable space search for graph coloring
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- An effective heuristic algorithm for sum coloring of graphs
- Minimum sum coloring of \(P_{4}\)-sparse graphs
This page was built for publication: New variable neighborhood search method for minimum sum coloring problem on simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389565)
