General variable neighborhood search approach to group Steiner tree problem

DOI10.1007/s11590-022-01904-7MaRDI QIDQ6063507

Slobodan Jelić, Tatjana Davidović, Luka Matijević

Publication date: 7 November 2023

Published in: Optimization Letters (Search for Journal in Brave)

zbMATH Keywords

local searchstochastic searchheuristic methodssuboptimal solutionsoptimization on graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested general variable neighborhood search for the periodic maintenance problem
• Variable neighbourhood search: methods and applications
• Variable neighbourhood search: Methods and applications
• The Steiner tree polytope and related polyhedra
• Variable neighborhood search
• Solving group Steiner problems as Steiner problems.
• Generalized spanning trees
• Variable neighborhood search: basics and variants
• Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
• A general variable neighborhood search for the cyclic antibandwidth problem
• Some formulations for the group Steiner tree problem
• Parallel Variable Neighborhood Search
• Variable Neighborhood Search
• On the generalized minimum spanning tree problem

This page was built for publication: General variable neighborhood search approach to group Steiner tree problem