An integer programming approach for solving the p-dispersion problem

DOI10.1016/J.EJOR.2016.02.026MaRDI QIDQ323154zbMATHOpenAlexWikidataFDO

Authors Fatemeh Sayyady, Yahya Fathi

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)

Recommendations

• The discrete p-dispersion problem
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• Heuristic and Special Case Algorithms for Dispersion Problems
• scientific article; zbMATH DE number 849075
• A new compact formulation for the discrete \(p\)-dispersion problem

Cites work

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

Cited in

(10)

• scientific article; zbMATH DE number 4143777 (Why is no real title available?)
• A review on discrete diversity and dispersion maximization from an OR perspective
• The discrete p-dispersion problem
• A new compact formulation for the discrete \(p\)-dispersion problem
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
• Measuring diversity. A review and an empirical analysis
• Formulations and valid inequalities for the capacitated dispersion problem
• A comparison of \(p\)-dispersion heuristics
• An exact cutting plane method for the Euclidean max-sum diversity problem
• The conditional \(p\)-dispersion problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323154)