A memetic algorithm for vertex-biconnectivity augmentation
From MaRDI portal
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Recommendations
- Evolutionary local search for the edge-biconnectivity augmentation problem
- An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- Approximation Algorithms for Graph Augmentation
Cited in
(2)
This page was built for publication: A memetic algorithm for vertex-biconnectivity augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472033)