On VLSI interconnect optimization and linear ordering problem (Q2443401): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LOLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11081-010-9128-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2136264331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental evaluation of a scatter search for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensification and diversification with elite tabu search solutions for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of VLSI power-delay optimization by interconnect resizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680289 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:25, 7 July 2024

scientific article
Language Label Description Also known as
English
On VLSI interconnect optimization and linear ordering problem
scientific article

    Statements

    On VLSI interconnect optimization and linear ordering problem (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2014
    0 references
    VLSI interconnects optimization
    0 references
    delay minimization
    0 references
    power minimization
    0 references
    linear ordering problem
    0 references
    optimal permutation
    0 references

    Identifiers