APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM

DOI10.15807/jorsj.39.258zbMath0863.90131OpenAlexW1561068705MaRDI QIDQ5284947

Chae Y. Lee, Taehoon Park

Publication date: 10 June 1997

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/94c452a20890d201443bc2cbfac513c38533cc2a

zbMATH Keywords

heuristicsfrequency assignment\(k\)-coloring problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

Simple decentralized graph coloring ⋮ Constraint and Satisfiability Reasoning for Graph Coloring ⋮ A column generation and branch-and-cut algorithm for the channel assignment problem ⋮ Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge ⋮ Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring ⋮ Models and solution techniques for frequency assignment problems

This page was built for publication: APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM