Scatter search for the minimum leaf spanning tree problem

DOI10.1016/j.cor.2022.105858OpenAlexW4280544294WikidataQ114193066 ScholiaQ114193066MaRDI QIDQ2147145

Yogita Singh Kardam, Rafael Martí, Pallavi Jain, Kamal Srivastava

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105858

zbMATH Keywords

metaheuristicsspanning treescatter search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scatter search with path relinking for the job shop with time lags and setup times
• Lower and upper bounds for the spanning tree with minimum branch vertices
• Scatter search for the bandpass problem
• Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
• Approximating the maximum internal spanning tree problem
• Complexities of some interesting problems on spanning trees
• Variable neighborhood scatter search for the incremental graph drawing problem
• An approximation algorithm for maximum internal spanning tree
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Minimal congestion trees
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
• Relations, models and a memetic approach for three degree-dependent spanning tree problems
• Complexity of independency and cliquy trees
• On the minimum leaf number of cubic graphs
• Better approximation algorithms for the maximum internal spanning tree problem
• On finding spanning trees with few leaves
• The traveling salesman problem on cubic and subcubic graphs
• A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem
• Approximation Algorithms for the Maximum Internal Spanning Tree Problem
• Spanning Trees and Optimization Problems
• Scatter Search and Path Relinking: Advances and Applications
• A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
• Algorithms and Data Structures
• Approximation algorithms for the maximum weight internal spanning tree problem

This page was built for publication: Scatter search for the minimum leaf spanning tree problem