A combinatorial optimization approach for the competence set expansion problem

DOI10.3969/J.ISSN.1005-3085.2019.05.008zbMATH Open1449.90304MaRDI QIDQ3306332FDOQ3306332

Authors: Hao Lin, Lan Lin 

Publication date: 12 August 2020

Recommendations

• Optimal competence set expansion using deduction graphs
• Minimum spanning table and optimal expansion of competence set
• Optimal multiple stage expansion of competence set
• Optimal Expansion Of Competence Sets And Decision Support
• Competence set expansion using an efficient 0-1 programming model

zbMATH Keywords

approximation algorithmexact algorithmNP-completenesspolynomial-time algorithmcompetence set

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (9)

• Multicriteria-multistage planning for the optimal path selection using hybrid genetic algorithms
• Title not available (Why is that?)
• A foundation for competence set analysis
• Title not available (Why is that?)
• Optimal multiple stage expansion of competence set
• Optimal expansion and design of competence sets with asymmetric acquiring costs
• Minimum spanning table and optimal expansion of competence set
• Marginal analysis for competence set expansion
• Competence set expansion using an efficient 0-1 programming model

This page was built for publication: A combinatorial optimization approach for the competence set expansion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3306332)