Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

A NEW EXTENSION PRINCIPLE ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM

Other title
UN NOUVEL ALGORITHME BASE SUR LE PRINCIPE D'EXTENSION POUR LE PROBLEME DU VOYAGEUR DE COMMERCE (fr)
Author
SCHEITHAUER G; TERNO J
TECH. UNIV. DRESDEN, SEKT. MATHEMATIK/DRESDEN 8027/DDR
Source
MATH. OPERATIONSFORSCH. STAT., SER. OPTIM.; ISSN 0323-3898; DDR; DA. 1982; VOL. 13; NO 2; PP. 231-245; ABS. GER/RUS; BIBL. 14 REF.
Document type
Article
Language
English
Keyword (fr)
ALGORITHME PROBLEME COMMIS VOYAGEUR PROBLEME COMBINATOIRE PROBLEME TRANSPORT RECHERCHE OPERATIONNELLE MATHEMATIQUES APPLIQUEES
Keyword (en)
ALGORITHM TRAVELLING SALESMAN PROBLEM COMBINATORY PROBLEM TRANSPORTATION PROBLEM OPERATIONAL RESEARCH APPLIED MATHEMATICS
Keyword (es)
MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL83X0123621

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

Searching the Web