An integer programming approach for solving the \(p\)-dispersion problem

DOI10.1016/j.ejor.2016.02.026zbMath1346.90521OpenAlexW2283476244WikidataQ57430945 ScholiaQ57430945MaRDI QIDQ323154

Yahya Fathi, Fatemeh Sayyady

Publication date: 7 October 2016

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.02.026

zbMATH Keywords

integer programminglocation problemmax-min diversitytraffic sensor location

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (5)

Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Measuring diversity. A review and an empirical analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Good solutions to discrete noxious location problems via metaheuristics
• The discrete p-dispersion problem
• A heuristic approach for the max-min diversity problem based on max-clique
• The equitable dispersion problem
• GRASP and path relinking for the max-min diversity problem
• Analytical models for locating undesirable facilities
• Computational aspects of the maximum diversity problem
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• An Analysis of Network Location Problems with Distance Constraints
• Finding a Maximum Clique in an Arbitrary Graph
• A Maxmin Location Problem
• Heuristic and Special Case Algorithms for Dispersion Problems

This page was built for publication: An integer programming approach for solving the \(p\)-dispersion problem