Improving heuristics for the frequency assignment problem (Q1296060): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A tabu search algorithm for frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of some known methods for \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum clique problem using a tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank

Revision as of 20:19, 28 May 2024

scientific article
Language Label Description Also known as
English
Improving heuristics for the frequency assignment problem
scientific article

    Statements

    Identifiers