A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650852 / rank
 
Normal rank
Property / zbMATH Keywords
 
optimization
Property / zbMATH Keywords: optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
networks
Property / zbMATH Keywords: networks / rank
 
Normal rank
Property / zbMATH Keywords
 
graphs
Property / zbMATH Keywords: graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
trees
Property / zbMATH Keywords: trees / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning trees
Property / zbMATH Keywords: spanning trees / rank
 
Normal rank
Property / zbMATH Keywords
 
capacitated minimum spanning tree
Property / zbMATH Keywords: capacitated minimum spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
biased random-key genetic algorithm
Property / zbMATH Keywords: biased random-key genetic algorithm / rank
 
Normal rank

Revision as of 06:26, 28 June 2023

scientific article
Language Label Description Also known as
English
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
scientific article

    Statements

    A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    optimization
    0 references
    combinatorial optimization
    0 references
    networks
    0 references
    graphs
    0 references
    trees
    0 references
    spanning trees
    0 references
    capacitated minimum spanning tree
    0 references
    heuristics
    0 references
    biased random-key genetic algorithm
    0 references