Using decomposition to improve greedy solutions of the optimal diversity management problem

DOI10.1111/ITOR.12004MaRDI QIDQ2862154zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Agostinho Agra, Cristina Requejo, Jorge Orestes Cerdeira

Publication date 14 November 2013

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12004

zbMATH Keywords

\(p\)-medianheuristicsinteger programminglocation problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• A decomposition approach for a very large scale optimal diversity management problem
• Solving huge size instances of the optimal diversity management problem
• The Optimal Diversity Management Problem
• A decomposition approach for the \(p\)-median problem on disconnected graphs
• Heuristic algorithms for the maximum diversity problem

Cites work

• A decomposition approach for a very large scale optimal diversity management problem
• Computational study of large-scale p-median problems
• Fast primal and dual heuristics for the \(p\)-median location problem
• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• Solution methods for thep-median problem: An annotated bibliography
• 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 minimum weight \(t\)-composition of an integer
• The Optimal Diversity Management Problem

Cited in

(8)

• Approaches to an occupancy problem resulting from MFSK systems with diversity and majority vote
• A decomposition approach for the \(p\)-median problem on disconnected graphs
• Solving the wire-harness design problem at a European car manufacturer
• A decomposition approach for a very large scale optimal diversity management problem
• The Optimal Diversity Management Problem
• On solving simplified diversified top-k\,s-plex problem
• Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the \(\mathrm{p}\)-median problem
• Solving huge size instances of the optimal diversity management problem

This page was built for publication: Using decomposition to improve greedy solutions 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 Q2862154)