Solving huge size instances of the optimal diversity management problem
DOI10.1007/S10958-009-9614-9zbMATH Open1192.49044OpenAlexW2004860288WikidataQ57736603 ScholiaQ57736603MaRDI QIDQ844532FDOQ844532
Authors: 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
Recommendations
- A decomposition approach for a very large scale optimal diversity management problem
- Using decomposition to improve greedy solutions of the optimal diversity management problem
- The Optimal Diversity Management Problem
- Solving large scale combinatorial optimization problems based on a divide and conquer strategy
- Hybrid heuristics for the maximum diversity problem
- Computational aspects of the maximum diversity problem
- Optimal results and tight bounds for the Maximum Diversity Problem
- A branch and bound algorithm for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
greedy algorithmNP-hardnesshuge size instancesindustry optimization problemoptimal diversity management problem
Complexity and performance of numerical algorithms (65Y20) Combinatorial optimization (90C27) Applications of optimal control and differential games (49N90)
Cites Work
Cited In (7)
- The minimum weight \(t\)-composition of an integer
- APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM
- On solving simplified diversified top-\(k\,s\)-plex problem
- The Optimal Diversity Management Problem
- Using decomposition to improve greedy solutions of the optimal diversity management problem
- A decomposition approach for the \(p\)-median problem on disconnected graphs
- A decomposition approach for a very large scale optimal diversity management problem
This page was built for publication: Solving huge size instances of the optimal diversity management problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844532)
