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

DOI10.1111/itor.12004zbMath1276.90036OpenAlexW2034291243WikidataQ57736563 ScholiaQ57736563MaRDI QIDQ2862154

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

heuristicsinteger programminglocation problems\(p\)-median

Mathematics Subject Classification ID

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

Related Items (2)

A decomposition approach for the \(p\)-median problem on disconnected graphs ⋮ Solving the wire-harness design problem at a European car manufacturer

Cites Work

• Unnamed Item
• The minimum weight \(t\)-composition of an integer
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem
• Solving huge size instances of the optimal diversity management problem
• Computational study of large-scale \(p\)-median problems
• Fast primal and dual heuristics for the \(p\)-median location problem
• A decomposition approach for a very large scale optimal diversity management problem
• Solution methods for thep-median problem: An annotated bibliography
• The Optimal Diversity Management Problem

This page was built for publication: Using decomposition to improve greedy solutions of the optimal diversity management problem