Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3083517

Using multiple searchers in constrained-path, moving-target search problems

Author
DELL, R. F1 ; EAGLE, J. N1 ; ALVES MARTINS, G. H; GARNIER SANTOS, A
[1] Operations Research Department, Naval Postgraduate School, Monterey, California 93943, United States
Source

Naval research logistics. 1996, Vol 43, Num 4, pp 463-480 ; ref : 23 ref

CODEN
NRLQAR
ISSN
0894-069X
Scientific domain
Control theory, operational research
Publisher
Wiley, New York, NY
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Algorithme génétique Algorithme optimal Cible mobile Détection cible Méthode branch and bound Méthode heuristique Problème recherche Chercheur multiple Recherche locale
Keyword (en)
Genetic algorithm Optimal algorithm Moving target Target detection Branch and bound method Heuristic method Search problem Local search
Keyword (es)
Algoritmo genético Algoritmo óptimo Blanco móvil Detección blanco Método branch and bound Método heurístico Problema investigación
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A16 Target location and tracking

Discipline
Operational research. Management
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
3083517

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web