A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: W2234356561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search for network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first multilevel cooperative algorithm for capacitated multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local branching heuristic for the capacitated fixed-charge network design problem / rank
 
Normal rank

Latest revision as of 16:16, 12 July 2024

scientific article
Language Label Description Also known as
English
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
scientific article

    Statements

    A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    multi-commodity network design
    0 references
    scatter search
    0 references
    evolutionary algorithms
    0 references
    ejection chains
    0 references
    iterated local search
    0 references

    Identifiers