A new compact formulation for the discrete \(p\)-dispersion problem
From MaRDI portal
Publication:1752169
DOI10.1016/j.ejor.2016.06.036zbMath1394.90395OpenAlexW2420904346MaRDI QIDQ1752169
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.06.036
Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (8)
Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ Safe distancing in the time of COVID-19 ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Discrete self-organizing migration algorithm and p-location problems ⋮ Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference ⋮ The conditional \(p\)-dispersion problem ⋮ A support tool for planning classrooms considering social distancing between students
Uses Software
Cites Work
- Unnamed Item
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- A simple and effective algorithm for the MaxMin diversity problem
- The discrete p-dispersion problem
- A heuristic approach for the max-min diversity problem based on max-clique
- Analytical models for locating undesirable facilities
- Easy and hard bottleneck location problems
- Integer-friendly formulations for the \(r\)-separation problem
- A fast algorithm for the maximum clique problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- A New Formulation and Resolution Method for the p-Center Problem
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Lagrangian solution of maximum dispersion problems
This page was built for publication: A new compact formulation for the discrete \(p\)-dispersion problem
