New variable neighborhood search method for minimum sum coloring problem on simple graphs
DOI10.22067/IJNAO.V8I2.61465OpenAlexW2899567973MaRDI QIDQ3389565FDOQ3389565
Authors: Sherbaf S. Rahimi, Jafar Fathali, K. Erfani 
Publication date: 23 March 2022
Full work available at URL: https://ijnao.um.ac.ir/article_24693_2bbabf7f26f0a5c69d2ab0e76d713492.pdf
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
variable neighborhood searchminimum sum coloringchromatic sumHölder setHölder vertexreducer setskewed variable neighborhood search
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- A graph-based hyper-heuristic for educational timetabling problems
- Improving heuristics for the frequency assignment problem
- A memetic algorithm for the minimum sum coloring problem
- An effective heuristic algorithm for sum coloring of graphs
- A tabu search approach for the sum coloring problem
- Lower bounds for the minimal sum coloring problem
- Bag rationalisation for a food manufacturer
- The chromatic sum of a graph: history and recent developments
- Title not available (Why is that?)
- Tight bounds on the chromatic sum of a connected graph
- Minimal coloring and strength of graphs
- Tabular graphs and chromatic sum
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
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)
