Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
From MaRDI portal
Publication:842713
DOI10.1007/s10898-008-9393-8zbMath1179.90240OpenAlexW2067346424MaRDI QIDQ842713
Peter A. jun. DiMaggio, Christodoulos A. Floudas, Scott R. McAllister
Publication date: 25 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9393-8
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- A survey for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Experiments in projection and clustering by simulated annealing
- A network flow model for biclustering via optimal re-ordering of data matrices
- QAPLIB - a quadratic assignment problem library
- Splitting an ordering into a partition to minimize diameter
- Prediction of oligopeptide conformations via deterministic global optimization
- Ab initio tertiary structure prediction of proteins
- Solving large quadratic assignment problems on computational grids
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- Assignment Problems and the Location of Economic Activities
- Some Simple Applications of the Travelling Salesman Problem
- Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
- Problem Decomposition and Data Reorganization by a Clustering Technique
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
