Biased random-key genetic algorithms with applications in telecommunications (Q1935883): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s11750-011-0176-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996472849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable IP network design with OSPF routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for road congestion minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the weight setting problem in OSPF routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions for general concave minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing internet capacity using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the resource constrained multi-project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random key based genetic algorithm for the resource constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and wavelength assignment by partition colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and wavelength assignment in optical networks using bin packing based algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:38, 6 July 2024

scientific article
Language Label Description Also known as
English
Biased random-key genetic algorithms with applications in telecommunications
scientific article

    Statements

    Biased random-key genetic algorithms with applications in telecommunications (English)
    0 references
    0 references
    20 February 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    optimization in telecommunications
    0 references
    genetic algorithm
    0 references
    biased random-key genetic algorithm
    0 references
    random keys
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    metaheuristics
    0 references
    0 references
    0 references