An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem (Q1877917): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial constraint satisfaction problem: Facets and lifting theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for fixed spectrum frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounding techniques for frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank

Latest revision as of 20:13, 6 June 2024

scientific article
Language Label Description Also known as
English
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
scientific article

    Statements

    An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Integer programming
    0 references
    Radio frequency assignment
    0 references
    Lower bounds
    0 references