Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Optimal competence set expansion using deduction graphs

Author
LI, H. L1 ; YU, P. L
[1] National Chiao Tung univ., inst. information management, Hsinchu, Taiwan, Province of China
Source

Journal of optimization theory and applications. 1994, Vol 80, Num 1, pp 75-91 ; ref : 12 ref

CODEN
JOTABN
ISSN
0022-3239
Scientific domain
Control theory, operational research; Computer science
Publisher
Springer, New York, NY
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Arbre maximal minimal Méthode branch and bound Politique optimale Prise décision Programmation entière Théorie décision Domaine habituel Ensemble compétence Graphe déduction Programmation zéro un
Keyword (en)
Minimal spanning tree Branch and bound method Optimal policy Decision making Integer programming Decision theory Zero one programming
Keyword (es)
Método branch and bound Política óptima Toma decision Programación entera Teoría decisión
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A08 Decision theory. Utility theory

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

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