An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem
From MaRDI portal
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)
Recommendations
- Evolutionary local search for the edge-biconnectivity augmentation problem
- A memetic algorithm for vertex-biconnectivity augmentation
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- An evolutionary programming algorithm for finding constrained optimal disjoint paths for multihop communication networks
- A unifying augmentation algorithm for two-edge connectivity and biconnectivity
- Bicriteria p-hub location problems and evolutionary algorithms
- A 1-\((S,T)\)-edge-connectivity augmentation algorithm
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
Cited in
(2)
This page was built for publication: An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770481)