Pages that link to "Item:Q5183272"
From MaRDI portal
The following pages link to Technical Note—Clustering a Data Array and the Traveling-Salesman Problem (Q5183272):
Displayed 9 items.
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
- A network flow model for biclustering via optimal re-ordering of data matrices (Q989888) (← links)
- Cell formation in manufacturing systems through simulated annealing: An experimental evaluation (Q1207537) (← links)
- Constructing blockmodels: how and why (Q1245783) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
- Stepwise decomposition approaches for large scale cell formation problems (Q1806640) (← links)
- Seriation and matrix reordering methods: An historical overview (Q4969706) (← links)
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem (Q5011679) (← links)