Particle swarm optimization and hill climbing for the bandwidth minimization problem (Q2383955): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10489-006-0019-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035831442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the bandwidth of a sparse matrix with tabu search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and path relinking for the matrix bandwidth minimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank

Latest revision as of 17:28, 26 June 2024

scientific article
Language Label Description Also known as
English
Particle swarm optimization and hill climbing for the bandwidth minimization problem
scientific article

    Statements

    Particle swarm optimization and hill climbing for the bandwidth minimization problem (English)
    0 references
    0 references
    0 references
    0 references
    20 September 2007
    0 references
    0 references
    Bandwidth minimization
    0 references
    Particle Swarm Optimization
    0 references
    Hill Climbing
    0 references
    0 references