The Optimal Diversity Management Problem
From MaRDI portal
Publication:5321732
DOI10.1287/opre.1040.0108zbMath1165.90432OpenAlexW2123909494MaRDI QIDQ5321732
Publication date: 14 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0107f6846e28d23bf9efd34ed4fac30bff0394d2
Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Production models (90B30)
Related Items
A computational study for the p-median Problem, The linking set problem: a polynomial special case of the multiple-choice knapsack problem, Solving huge size instances of the optimal diversity management problem, The component commonality problem in a real multidimensional space: an algorithmic approach, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, A decomposition approach for the \(p\)-median problem on disconnected graphs, Computational study of large-scale \(p\)-median problems, Imposing Contiguity Constraints in Political Districting Models, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, Optimal design of line replaceable units, An efficient Benders decomposition for the \(p\)-median problem, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, Complexity evaluation of benchmark instances for the \(p\)-median problem, Data aggregation for \(p\)-median problems, Solving the wire-harness design problem at a European car manufacturer, The minimum weight \(t\)-composition of an integer, A fast swap-based local search procedure for location problems, A computational study of a nonlinear minsum facility location problem, A tighter formulation of the \(p\)-median problem, Using decomposition to improve greedy solutions of the optimal diversity management problem
