Heuristics for the network design problem with connectivity requirements

DOI10.1007/s10878-015-9834-5zbMath1347.90084OpenAlexW2090101412MaRDI QIDQ281782

Roman E. Shangin, Panos M. Pardalos

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9834-5

zbMATH Keywords

heuristicsvariable neighborhood searchnetwork design\(k\)-treesrobust networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A temporal logic programming approach to planning

Cites Work

• Unnamed Item
• Unnamed Item
• On some network design problems with degree constraints
• On generalizations of network design problems with degree bounds
• On the SPANNING \(k\)-TREE problem
• Some simplified NP-complete graph problems
• On some optimization problems on \(k\)-trees and partial \(k\)-trees
• On simple characterizations of k-trees
• Exact approaches for solving robust prize-collecting Steiner tree problems
• Triangulated graphs and the elimination process
• New branch-and-bound algorithms for k-cardinality tree problems
• Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach
• Probabilistic Recovery Guarantees for Sparsely Corrupted Signals
• Steiner trees, partial 2–trees, and minimum IFI networks
• Networks immune to isolated failures
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Strong formulations for network design problems with connectivity requirements