Pages that link to "Item:Q1029698"
From MaRDI portal
The following pages link to Branch and bound algorithm for multidimensional scaling with city-block metric (Q1029698):
Displaying 14 items.
- Pareto-optimal front of cell formation problem in group technology (Q486727) (← links)
- Parallel branch and bound for multidimensional scaling with city-block distances (Q693147) (← links)
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007) (← links)
- A hybrid method for multidimensional scaling using city-block distances (Q999136) (← links)
- Global optimization in any Minkowski metric: A permutation-translation simulated annealing algorithm for multidimensional scaling (Q1015451) (← links)
- On global optimization in two-dimensional scaling (Q1321575) (← links)
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps (Q1681355) (← links)
- An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
- Two level minimization in multidimensional scaling (Q2465484) (← links)
- Cloud Computing Approach for Intelligent Visualization of Multidimensional Data (Q2958615) (← links)
- Comparative Study of Different Penalty Functions and Algorithms in Survey Calibration (Q2958616) (← links)
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
- Parallel Global Optimization in Multidimensional Scaling (Q3613502) (← links)
- (Q4925075) (← links)