An approximate solution method based on tabu search for k-minimum spanning tree problems

Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishizaki, Jun Ishimatsu. An approximate solution method based on tabu search for k-minimum spanning tree problems. IJKESDP, 2(3):263-274, 2010. [doi]

@article{KatagiriHNI10,
  title = {An approximate solution method based on tabu search for k-minimum spanning tree problems},
  author = {Hideki Katagiri and Tomohiro Hayashida and Ichiro Nishizaki and Jun Ishimatsu},
  year = {2010},
  doi = {10.1504/IJKESDP.2010.035908},
  url = {http://dx.doi.org/10.1504/IJKESDP.2010.035908},
  tags = {rule-based, search},
  researchr = {https://researchr.org/publication/KatagiriHNI10},
  cites = {0},
  citedby = {0},
  journal = {IJKESDP},
  volume = {2},
  number = {3},
  pages = {263-274},
}