A decomposition approach for a very large scale optimal diversity management problem
From MaRDI portal
Publication:2386679
Recommendations
- Using decomposition to improve greedy solutions of the optimal diversity management problem
- Solving huge size instances of the optimal diversity management problem
- A decomposition approach for the \(p\)-median problem on disconnected graphs
- The decomposition method for the \(p\)-median problem on a disconnected graph
- The Optimal Diversity Management Problem
Cited in
(11)- The Optimal Diversity Management Problem
- A decomposition approach for the \(p\)-median problem on disconnected graphs
- The decomposition method for the \(p\)-median problem on a disconnected graph
- A computational study of a nonlinear minsum facility location problem
- Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
- The minimum weight \(t\)-composition of an integer
- Approaches to an occupancy problem resulting from MFSK systems with diversity and majority vote
- Solving huge size instances of the optimal diversity management problem
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem
- The component commonality problem in a real multidimensional space: an algorithmic approach
- Using decomposition to improve greedy solutions of the optimal diversity management problem
This page was built for publication: A decomposition approach for a very large scale optimal diversity management problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386679)