Branch and bound algorithm for multidimensional scaling with city-block metric
type: Item
instance of: scholarly article
title: Branch and bound algorithm for multidimensional scaling with city-block metric
zbMATH Open document ID: 1179.90250
author: Antanas Žilinskas
author: Julius Žilinskas
published in: Journal of Global Optimization
publication date: 2009-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5577758
zbMATH Keywords: multidimensional scaling
zbMATH Keywords: city-block metric
zbMATH Keywords: branch and bound
MaRDI profile type: Publication
full work available at URL: s10898-008-9306-x
OpenAlex ID: W1994259199
cites work: Was Euclid an unnecessarily sophisticated psychologist?
cites work: Modern multidimensional scaling. Theory and applications.
cites work: A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
cites work: Q5706832
cites work: Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
cites work: The majorization approach to multidimensional scaling for Minkowski distances
cites work: Q4217767
cites work: Global optimization in least-squares multidimensional scaling by distance smoothing
cites work: Q3447264
cites work: Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization
cites work: Two level minimization in multidimensional scaling
cites work: Q4209605
DOI: 10.1007/S10898-008-9306-X
Recommended article: Parallel branch and bound for multidimensional scaling with city-block distances
Recommended article: MULTIDIMENSIONAL SCALING WITH CITY‐BLOCK DISTANCES BASED ON COMBINATORIAL OPTIMIZATION AND SYSTEMS OF LINEAR EQUATIONS
Recommended article: A hybrid method for multidimensional scaling using city-block distances
Recommended article: Probabilistic multidimensional scaling using a city-block metric
Recommended article: Q4925075
Recommended article: MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance
Recommended article: A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
Recommended article: Branch and bound algorithms for the multidimensional assignment problem
Recommended article: Q4209605
description: scientific article; zbMATH DE number 5577758