scientific article; zbMATH DE number 2079893

zbMATH Open1044.68774MaRDI QIDQ4472033FDOQ4472033

Sandor Kersting, Ivana Ljubić, Günther R. Raidl

Publication date: 3 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2279/22790102.htm

Title of this publication is not available (Why is that?)

Recommendations

• Evolutionary local search for the edge-biconnectivity augmentation problem
• Publication:2770481
• 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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cited In (2)

• Evolutionary local search for the edge-biconnectivity augmentation problem
• Title not available (Why is that?)

This page was built for publication:

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