On solving the multiple p-median problem based on biclustering
Authors:
- 13 February 2019
- journal article
- research article
- Published by Springer Nature in Operational Research
- Vol. 21 (1) , 775-799
Abstract
No abstract availableKeywords
This publication has 52 references indexed in Scilit:
- An aggregation heuristic for large scale p-median problemComputers & Operations Research, 2012
- Computational study of large-scale p-Median problemsMathematical Programming, 2006
- Biclustering algorithms for biological data analysis: a surveyIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Discrete location theory, edited by P. B. Mirchandani and R. L. Francis, John Wiley & Sons, New York, 1990, 555 pp.Networks, 1994
- A more efficient heuristic for solving largep-median problemsPapers in Regional Science, 1992
- Stages in the Adoption of a Spatial Decision Support System for Reorganizing Service Delivery RegionsEnvironment and Planning C: Government and Policy, 1991
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Direct Clustering of a Data MatrixJournal of the American Statistical Association, 1972
- Central Facilities LocationGeographical Analysis, 1970
- On the Location of Supply Points to Minimize Transport CostsJournal of the Operational Research Society, 1964