Branch and bound algorithm for multidimensional scaling with city-block metric
From MaRDI portal
Publication:1029698
DOI10.1007/s10898-008-9306-xzbMath1179.90250OpenAlexW1994259199MaRDI QIDQ1029698
Antanas Žilinskas, Julius Žilinskas
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9306-x
Related Items
On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Cloud Computing Approach for Intelligent Visualization of Multidimensional Data ⋮ Comparative Study of Different Penalty Functions and Algorithms in Survey Calibration ⋮ Pareto-optimal front of cell formation problem in group technology ⋮ Parallel branch and bound for multidimensional scaling with city-block distances ⋮ Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds ⋮ Parallel Global Optimization in Multidimensional Scaling ⋮ Depth-first simplicial partition for copositivity detection, with an application to MaxClique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Was Euclid an unnecessarily sophisticated psychologist?
- A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
- The majorization approach to multidimensional scaling for Minkowski distances
- Global optimization in least-squares multidimensional scaling by distance smoothing
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization
- Two level minimization in multidimensional scaling
- Modern multidimensional scaling. Theory and applications.
