Solving huge size instances of the optimal diversity management problem
From MaRDI portal
Publication:844532
DOI10.1007/s10958-009-9614-9zbMath1192.49044OpenAlexW2004860288WikidataQ57736603 ScholiaQ57736603MaRDI QIDQ844532
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
greedy algorithmNP-hardnesshuge size instancesindustry optimization problemoptimal diversity management problem
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