Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

DECOMPOSITION ALGORITHMS FOR LOCATING MINIMAL CUTS IN A NETWORK

Author
JARVIS JJ; TUFEKCI S
GEORGIA INST. TECHNOL./ATLANTA GA/USA
Source
MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1982; VOL. 22; NO 3; PP. 316-331; BIBL. 22 REF.
Document type
Article
Language
English
Keyword (fr)
METHODE DECOMPOSITION ALGORITHME RESEAU GRAPHE ORIENTE PROBLEME TRANSPORT COUPE MINIMALE RECHERCHE OPERATIONNELLE MATHEMATIQUES APPLIQUEES
Keyword (en)
DECOMPOSITION METHOD ALGORITHM NETWORK DIRECTED GRAPH 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
PASCAL83X0066810

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