Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

MaRDI QIDQ3436634zbMATHzbMATHFDO

Authors Michał Witold Przewoźniczek, Krzysztof Walkowiak

Publication date 11 May 2007

Full work available at URL https://eudml.org/doc/207808

zbMATH Keywords

evolution algorithmpath-assignment problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Recommendations

• Two-level evolutionary approach to the survivable mesh-based transport network topological design
• A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
• scientific article; zbMATH DE number 2040760
• A Lagrangean relaxation algorithm for flow optimization in survivable MPLS networks
• scientific article; zbMATH DE number 1835984

This page was built for publication: Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3436634)