Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Parallel iterative search methods for vehicle routing problems

Author
TAILLARD, E
Ecole polytech. Lausanne, dép. mathématiques, 1015 Lausanne, Switzerland
Source

Networks (New York, NY). 1993, Vol 23, Num 8, pp 661-673 ; ref : 21 ref

CODEN
NTWKAA
ISSN
0028-3045
Scientific domain
Control theory, operational research
Publisher
John Wiley & Sons, New York, NY
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Acheminement Algorithme recherche Méthode itérative Méthode partition Optimisation combinatoire Problème livraison Problème transport Recherche tabou
Keyword (en)
Routing Search algorithm Iterative method Partition method Combinatorial optimization Dispatching problem Transportation problem Tabu search
Keyword (es)
Encaminamiento Algoritmo búsqueda Método iterativo Método partición Optimización combinatoria Problema reparto Problema transporte
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems

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

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