Optimal competence set expansion using deduction graphs
type: Item
instance of: scholarly article
title: Optimal competence set expansion using deduction graphs
zbMATH Open document ID: 0792.90002
DOI: 10.1007/BF02196594
author: V. Pereyra
published in: Journal of Optimization Theory and Applications
publication date: 1994-07-25T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 557917
zbMATH Keywords: branch-and-bound
zbMATH Keywords: deduction graphs
zbMATH Keywords: habitual domains
zbMATH Keywords: competence set
zbMATH Keywords: minimum spanning tree
describes a project that uses: LINDO
MaRDI profile type: Publication
cites work: A foundation for competence set analysis
cites work: Optimal Expansion Of Competence Sets And Decision Support
cites work: Deduction graphs: an algorithm and applications
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
cites work: Marginal analysis for competence set expansion
full work available at URL: https://doi.org/10.1007/bf02196594
OpenAlex ID: W1968602537
description: scientific article; zbMATH DE number 557917