New variable neighborhood search method for minimum sum coloring problem on simple graphs

DOI10.22067/ijnao.v8i2.61465OpenAlexW2899567973MaRDI QIDQ3389565

Jafar Fathali, Sherbaf S. Rahimi, Kh. Erfani

Publication date: 23 March 2022

Full work available at URL: https://ijnao.um.ac.ir/article_24693_2bbabf7f26f0a5c69d2ab0e76d713492.pdf

zbMATH Keywords

variable neighborhood searchminimum sum coloringchromatic sumHölder setHölder vertexreducer setskewed variable neighborhood search

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A memetic algorithm for the minimum sum coloring problem
• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
• Improving heuristics for the frequency assignment problem
• Variable neighborhood search
• An effective heuristic algorithm for sum coloring of graphs
• The chromatic sum of a graph: history and recent developments
• A new ant colony optimization algorithm for the lower bound of sum coloring problem
• Minimal coloring and strength of graphs
• A graph-based hyper-heuristic for educational timetabling problems
• Tabular graphs and chromatic sum
• Lower Bounds for the Minimal Sum Coloring Problem
• Tight bounds on the chromatic sum of a connected graph
• Bag rationalisation for a food manufacturer
• Variable neighborhood search: Principles and applications

This page was built for publication: New variable neighborhood search method for minimum sum coloring problem on simple graphs