Solving huge size instances of the optimal diversity management problem

DOI10.1007/s10958-009-9614-9zbMath1192.49044OpenAlexW2004860288WikidataQ57736603 ScholiaQ57736603MaRDI QIDQ844532

N. E. Zubov

Publication date: 19 January 2010

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-009-9614-9

zbMATH Keywords

greedy algorithmNP-hardnesshuge size instancesindustry optimization problemoptimal diversity management problem

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Related Items

A decomposition approach for the \(p\)-median problem on disconnected graphs, The minimum weight \(t\)-composition of an integer, APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM, Using decomposition to improve greedy solutions of the optimal diversity management problem

Cites Work

• Unnamed Item
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem
• A decomposition approach for a very large scale optimal diversity management problem
• The Optimal Diversity Management Problem