A generalized orienteering problem for optimal search and interdiction planning
Approved for public release; distribution is unlimited === In order to support search planning for counterdrug operations, we introduce a generalized Orienteering Problem (OP) where transit on arcs in a network and reward collection at nodes both consume a variable amount of the same limited resourc...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Monterey, California: Naval Postgraduate School
2013
|
| Online Access: | http://hdl.handle.net/10945/37694 |