A combinatorial optimization approach for the competence set expansion problem

DOI10.3969/J.ISSN.1005-3085.2019.05.008MaRDI QIDQ3306332zbMATH OpenFDO

Authors Hao Lin, Lan Lin

Publication date 12 August 2020

Full work available at URL https://doi.org/10.3969/J.ISSN.1005-3085.2019.05.008

zbMATH Keywords

approximation algorithmcompetence setexact algorithmNP-completenesspolynomial-time algorithm

Mathematics Subject Classification ID

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

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

Cited in

(10)

• Marginal analysis for competence set expansion
• Optimal competence set expansion using deduction graphs
• 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
• Competence set expansion using an efficient 0-1 programming model
• scientific article; zbMATH DE number 1530355 (Why is no real title available?)
• scientific article; zbMATH DE number 2159105 (Why is no real title available?)
• A foundation for competence set analysis
• Multicriteria-multistage planning for the optimal path selection using hybrid genetic algorithms

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)