A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054006251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Network Topological Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294063 / 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: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for concave network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent extreme flows and application to min concave cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design techniques using adapted genetic algorithms / 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 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 parallel multi-population biased random-key genetic algorithm for a container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow models for spanning trees with hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hop constrained min-sum arborescence with outage costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet reordering in networks with heavy-tailed delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the robust spanning tree problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear modeling solution approach for fixed charge network flow problems / rank
 
Normal rank

Latest revision as of 18:48, 6 July 2024

scientific article
Language Label Description Also known as
English
A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
scientific article

    Statements

    A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (English)
    0 references
    27 August 2013
    0 references
    multi-population
    0 references
    genetic algorithms
    0 references
    local search
    0 references
    network flows
    0 references
    hop-constrained trees
    0 references
    general nonlinear costs
    0 references
    0 references
    0 references
    0 references

    Identifiers