Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Algorithms for the universal and a priori TSP

Author
SCHALEKAMP, Frans1 ; SHMOYS, David B1
[1] School of ORIE, Comell University, 288 Rhodes Hall, Ithaca, NY 14853, United States
Source

Operations research letters. 2008, Vol 36, Num 1, pp 1-3, 3 p ; ref : 17 ref

CODEN
ORLED5
ISSN
0167-6377
Scientific domain
Control theory, operational research
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
A priori optimization Metric embedding Traveling salesman problem Universal optimization
Keyword (fr)
Algorithme approximation Algorithme randomisé Arbre graphe Métrique Optimisation Plan randomisé Plongement Problème commis voyageur Tour itinéraire
Keyword (en)
Approximation algorithm Randomized algorithm Tree(graph) Metric Optimization Randomized design Embedding Travelling salesman problem Tour
Keyword (es)
Algoritmo aproximación Algoritmo aleatorizado Arbol grafo Métrico Optimización Plan aleatorizado Inmersión Problema viajante comercio Vuelta
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A15 Logistics

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

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