A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion (Q3087853): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mauricio G. C. Resende / rank
Normal rank
 
Property / author
 
Property / author: Mauricio G. C. Resende / 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.1111/j.1475-3995.2010.00771.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047565057 / 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: Internet Routing and Related Topology Issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective design of survivable IP networks / 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: A genetic algorithm for the weight setting problem in OSPF routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing internet capacity using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Internet Protocol network design and routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Algorithm for a Generalization of the Shortest-Path Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:14, 4 July 2024

scientific article
Language Label Description Also known as
English
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
scientific article

    Statements

    A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    networks
    0 references
    networking
    0 references
    telecommunication networks
    0 references
    routing
    0 references
    genetic algorithm
    0 references
    biased random-key genetic algorithm
    0 references
    local search
    0 references
    metaheuristics
    0 references
    0 references