Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

The one-commodity pickup and delivery travelling salesman problem on a path or a tree

Author
FAN WANG1 ; LIM, Andrew2 ; ZHOU XU2
[1] School of Business, Sun Yat-Sen University, Guangzhou, China
[2] Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Clear Water Bay, Hong-Kong
Source

Networks (New York, NY). 2006, Vol 48, Num 1, pp 24-35, 12 p ; ref : 14 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
Author keyword
path pickup and delivery travelling salesman problem tree
Keyword (fr)
Chemin graphe Optimisation Problème NP difficile Problème commis voyageur Structure arborescente Pickup and delivery
Keyword (en)
Graph path Optimization NP hard problem Travelling salesman problem Tree structure
Keyword (es)
Camino grafo Optimización Problema NP duro Problema viajante comercio Estructura arborescente
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

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04B Telecommunications / 001D04B03 Teleprocessing networks. Isdn / 001D04B03B Valuation and optimization of characteristics. Simulation

Discipline
Operational research. Management Telecommunications and information theory
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
17935882

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