A genetic approach for the 2‐edge‐connected minimum branch vertices problem

DOI10.1002/net.22142OpenAlexW4318823402MaRDI QIDQ6180021

Raffaele Cerulli, Francesco Carrabs, Federica Laureana, Domenico Serra, Carmine Sorgente

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22142

zbMATH Keywords

genetic algorithmsoptical networksnetwork designnetwork optimizationbranch vertices2-edge-connectivity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Mathematical programming (90Cxx) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
• Lower and upper bounds for the spanning tree with minimum branch vertices
• Bounded-degree spanning tree problems: models and new algorithms
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
• An exact and heuristic approach for the \(d\)-minimum branch vertices problem
• A note on finding the bridges of a graph
• A simple test on 2-vertex- and 2-edge-connectivity
• The generalized minimum branch vertices problem: properties and polyhedral analysis
• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
• Approximation Algorithms for Graph Augmentation
• Augmentation Problems
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A genetic approach for the 2‐edge‐connected minimum branch vertices problem