General variable neighborhood search for the minimum stretch spanning tree problem
From MaRDI portal
Publication:6063503
DOI10.1007/s11590-022-01918-1WikidataQ114222141 ScholiaQ114222141MaRDI QIDQ6063503
Yogita Singh Kardam, Rafael Martí, Kamal Srivastava
Publication date: 7 November 2023
Published in: Optimization Letters (Search for Journal in Brave)
spanning treesartificial bee colonygeneral variable neighborhood searchminimum stretch spanning tree problem
Cites Work
- Unnamed Item
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Spanning trees: A survey
- Shortest path planning for a tethered robot
- Computing a minimum-dilation spanning tree is NP-hard
- Variable neighborhood search
- Variable neighborhood scatter search for the incremental graph drawing problem
- Variable neighborhood search: basics and variants
- The minimum stretch spanning tree problem for typical graphs
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- The multi-criteria minimum spanning tree problem based genetic algorithm
- The zoo of tree spanner problems
- Optimality computation of the minimum stretch spanning tree problem
- Computing Minimum Dilation Spanning Trees in Geometric Graphs
- Handbook of Heuristics
- Spanning Trees and Optimization Problems
- A trade-off between space and efficiency for routing tables
- An Optimal Synchronizer for the Hypercube
- Tree Spanners
This page was built for publication: General variable neighborhood search for the minimum stretch spanning tree problem