A decomposition approach for the \(p\)-median problem on disconnected graphs

DOI10.1016/j.cor.2017.05.006zbMath1391.90364OpenAlexW2612626424WikidataQ57736467 ScholiaQ57736467MaRDI QIDQ1652380

Jorge Orestes Cerdeira, Cristina Requejo, Agostinho Agra

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.05.006

zbMATH Keywords

decompositionlocationoptimal diversity management problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

An exact column-generation approach for the lot-type design problem

Uses Software

• R
• XPRESS

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
• Fast primal and dual heuristics for the \(p\)-median location problem
• A bibliography for some fundamental problem categories in discrete location science
• A decomposition approach for a very large scale optimal diversity management problem
• Using decomposition to improve greedy solutions of the optimal diversity management problem
• Solution methods for thep-median problem: An annotated bibliography
• The Optimal Diversity Management Problem

This page was built for publication: A decomposition approach for the \(p\)-median problem on disconnected graphs