"Approximate solution of the multiple watchman routes problem with ..."

Jan Faigl (2010)

> Home

Details and statistics

DOI: 10.1109/TNN.2010.2070518

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tnn/Faigl10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tnn/Faigl10
Jan Faigl:
Approximate solution of the multiple watchman routes problem with restricted visibility range. IEEE Trans. Neural Networks 21(10): 1668-1679 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.