Variable neighbourhood search for bandwidth reduction (Q2379517): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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.1016/j.ejor.2008.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028089274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding exact solutions to the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for matrix bandwidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Particle swarm optimization and hill climbing for the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the matrix bandwidth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation descent applied to circle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulation Space Search for Circle Packing Problems / 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: GRASP and path relinking for the matrix bandwidth minimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved simulated annealing algorithm for bandwidth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem / rank
 
Normal rank

Latest revision as of 14:13, 2 July 2024

scientific article
Language Label Description Also known as
English
Variable neighbourhood search for bandwidth reduction
scientific article

    Statements

    Variable neighbourhood search for bandwidth reduction (English)
    0 references
    19 March 2010
    0 references
    matrix bandwidth minimization
    0 references
    metaheuristics
    0 references
    0 references
    0 references

    Identifiers