Pages that link to "Item:Q676477"
From MaRDI portal
The following pages link to The tunneling method for global optimization in multidimensional scaling (Q676477):
Displayed 13 items.
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
- Graphics processing units and high-dimensional optimization (Q906530) (← links)
- Probabilistic multidimensional scaling using a city-block metric (Q1599153) (← links)
- Better initial configurations for metric multidimensional scaling (Q1874126) (← links)
- Estimating the city-block two-dimensional scaling model with simulated annealing (Q1876150) (← links)
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization (Q1955543) (← links)
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052) (← links)
- Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation (Q2260065) (← links)
- An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
- An interactive multiobjective programming approach to combinatorial data analysis (Q2511823) (← links)
- On the Bumpy Road to the Dominant Mode (Q3103143) (← links)
- Parallel Global Optimization in Multidimensional Scaling (Q3613502) (← links)