General variable neighborhood search for the minimum stretch spanning tree problem

DOI10.1007/S11590-022-01918-1MaRDI QIDQ6063503zbMATH OpenWikidataFDO

Authors Yogita Singh Kardam, Kamal Srivastava, Rafael Martí

Publication date 7 November 2023

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-022-01918-1

zbMATH Keywords

artificial bee colonygeneral variable neighborhood searchminimum stretch spanning tree problemspanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Scatter search for the minimum leaf spanning tree problem
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
• A hybrid metaheuristic for the minimum labeling spanning tree problem
• Upper and lower bounding strategies for the generalized minimum spanning tree problem

Cites work

• A trade-off between space and efficiency for routing tables
• An Optimal Synchronizer for the Hypercube
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Computing a minimum-dilation spanning tree is NP-hard
• Computing minimum dilation spanning trees in geometric graphs
• Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
• Handbook of heuristics
• Introduction to algorithms.
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
• Optimality computation of the minimum stretch spanning tree problem
• Shortest path planning for a tethered robot
• Spanning Trees and Optimization Problems
• Spanning trees: A survey
• The minimum stretch spanning tree problem for typical graphs
• The multi-criteria minimum spanning tree problem based genetic algorithm
• The zoo of tree spanner problems
• Tree Spanners
• Variable neighborhood scatter search for the incremental graph drawing problem
• Variable neighborhood search
• Variable neighborhood search: basics and variants

Cited in

(6)

• Variable neighbourhood search for the minimum labelling Steiner tree problem
• scientific article; zbMATH DE number 5005302 (Why is no real title available?)
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• Iterated local search with two strategies in the acceptance criterion for the tree t-spanner problem
• Carousel greedy algorithms for the minimum stretch spanning tree problem
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

This page was built for publication: General variable neighborhood search for the minimum stretch spanning tree problem

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