Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

FORMULATIONS AND ALGORITHMS FOR THE CAPACITATED MINIMAL DIRECTED TREE PROBLEM

Author
GAVISH B
UNIV. ROCHESTER, GRADUATE SCHOOL MANAGEMENT/ROCHESTER NY 14627/USA
Source
JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 118-132; BIBL. 24 REF.
Document type
Article
Language
English
Keyword (fr)
ARCHITECTURE SYSTEME MODELISATION RESEAU ORDINATEUR PROGRAMMATION ENTIERE GRAPHE ORIENTE PROBLEME COMBINATOIRE SYSTEME INFORMATIQUE CAPACITE MINIMALE INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
SYSTEM ARCHITECTURE MODELIZATION COMPUTER NETWORK INTEGER PROGRAMMING DIRECTED GRAPH COMBINATORY PROBLEM COMPUTER SYSTEM COMPUTER SCIENCES APPLIED MATHEMATICS
Keyword (es)
INFORMATICA 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
PASCAL83X0182785

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