The equitable dispersion problem
Authors:
- Oleg A. ProkopyevOPOleg A. Prokopyev
- Nan KongNKNan Kong
- Dayna L. Martinez-TorresDMDayna L. Martinez-Torres
- 1 August 2009
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 197 (1) , 59-67
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Lower Bound Improvement and Forcing Rule for Quadratic Binary ProgrammingComputational Optimization and Applications, 2005
- Maximum diversity/similarity models with extension to part groupingInternational Transactions in Operational Research, 2005
- An empirical comparison of heuristic methods for creating maximally diverse groupsJournal of the Operational Research Society, 1998
- Approximation algorithms for maximum dispersionOperations Research Letters, 1997
- A note on a global approach for general 0–1 fractional programmingEuropean Journal of Operational Research, 1997
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*Decision Sciences, 1993
- Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion ProblemsGeographical Analysis, 1987
- A network flow solution to some nonlinear 0‐1 programming problems, with applications to graph theoryNetworks, 1982
- TOWARD A THEORY OF URBAN PUBLIC FACILITY LOCATIONPapers in Regional Science, 1968