Generation of lower bounds for minimum span frequency assignment (Q1602703): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126982390, #quickstatements; #temporary_batch_1724929748353
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FASoft / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounding techniques for frequency assignment / 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: Q4792089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(01)00265-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106584680 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126982390 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:14, 29 August 2024

scientific article
Language Label Description Also known as
English
Generation of lower bounds for minimum span frequency assignment
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references