Improving heuristics for the frequency assignment problem
type: Item
instance of: scholarly article
title: Improving heuristics for the frequency assignment problem
zbMATH Open document ID: 0943.90056
DOI: 10.1016/S0377-2217(98)80006-4
author: S. U. Thiel
author: Derek H. Smith
author: Steve Hurley
published in: European Journal of Operational Research
publication date: 1999-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1314757
zbMATH Keywords: frequency assignment
zbMATH Keywords: heuristics
zbMATH Keywords: graph theory
describes a project that uses: FASoft
MaRDI profile type: Publication
cites work: A tabu search algorithm for frequency assignment
cites work: On the use of some known methods for \(T\)-colorings of graphs
cites work: Q4336207
cites work: Bounds for the frequency assignment problem
cites work: \(T\)-colorings of graphs: recent results and open problems
cites work: Sur le coloriage des graphs
cites work: An exact algorithm for the maximum clique problem
cites work: Solving the maximum clique problem using a tabu search approach
cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
full work available at URL: s0377-2217(98)80006-4
OpenAlex ID: W1974105863
description: scientific article; zbMATH DE number 1314757