Parallel branch and bound for multidimensional scaling with city-block distances
Multidimensional scaling is a technique for exploratory analysis of multidimensional data. The essential part of the technique is minimization of a multimodal function with unfavorable properties like invariants and non-differentiability. Recently a branch and bound algorithm for multidimensional scaling with city-block distances has been proposed for solution of medium-size problems exactly. The algorithm exploits piecewise quadratic structure of the objective function. In this paper a parallel version of the branch and bound algorithm for multidimensional scaling with city-block distances has been proposed and investigated. Parallel computing enabled solution of larger problems what was not feasible with the sequential version. Copyright Springer Science+Business Media, LLC. 2012
Volume (Year): 54 (2012)
Issue (Month): 2 (October)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10898|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Leung, Pui Lam & Lau, Kin-nam, 2004. "Estimating the city-block two-dimensional scaling model with simulated annealing," European Journal of Operational Research, Elsevier, vol. 158(2), pages 518-524, October.
- Lawrence Hubert & Phipps Arabie & Matthew Hesson-Mcinnis, 1992. "Multidimensional scaling in the city-block metric: A combinatorial approach," Journal of Classification, Springer;The Classification Society, vol. 9(2), pages 211-236, December.
- P. J. F. Groenen & W. J. Heiser & J. J. Meulman, 1999. "Global Optimization in Least-Squares Multidimensional Scaling by Distance Smoothing," Journal of Classification, Springer;The Classification Society, vol. 16(2), pages 225-254, July.
- Jan Leeuw, 1984. "Differentiability of Kruskal's stress at a local minimum," Psychometrika, Springer;The Psychometric Society, vol. 49(1), pages 111-113, March.
- Patrick Groenen & Rudolf Mathar & Willem Heiser, 1995. "The majorization approach to multidimensional scaling for Minkowski distances," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 3-19, March.
- J. Fernando Vera & Willem J. Heiser & Alex Murillo, 2007. "Global Optimization in Any Minkowski Metric: A Permutation-Translation Simulated Annealing Algorithm for Multidimensional Scaling," Journal of Classification, Springer;The Classification Society, vol. 24(2), pages 277-301, September.
- Phipps Arabie, 1991. "Was euclid an unnecessarily sophisticated psychologist?," Psychometrika, Springer;The Psychometric Society, vol. 56(4), pages 567-587, December.
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:2:p:261-274. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.