The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs

Cees Duin, Stefan Voß. The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34(3):181-191, 1999. [doi]

@article{DuinV99,
  title = {The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs},
  author = {Cees Duin and Stefan Voß},
  year = {1999},
  doi = {10.1002/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y},
  url = {http://dx.doi.org/10.1002/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y},
  tags = {graph-rewriting, rewriting, rewriting strategies},
  researchr = {https://researchr.org/publication/DuinV99},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {34},
  number = {3},
  pages = {181-191},
}