The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search

DOI10.1002/net.20370zbMath1207.05187OpenAlexW4241957807WikidataQ57705375 ScholiaQ57705375MaRDI QIDQ3057152

Günther R. Raidl, Markus Leitner, Bin Hu

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

mixed integer programmingvariable neighborhood searchnetwork designbiconnectivity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (3)

Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ A heuristic approach for dividing graphs into bi-connected components with a size constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• Generalized network design problems.
• The prize-collecting generalized minimum spanning tree problem
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• Biconnectivity approximations and graph carvings
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• On the generalized minimum spanning tree problem
• On generalized minimum spanning trees

This page was built for publication: The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search