Analysis of integer programming formulations of clustering problems

Abstract Five different integer programming formulations of the clustering problem are discussed. Three new heuristic algorithms for solving these problems are presented. Some of the existing algorithms are generalized. The relevance of integer programming and combinatorial theory to cluster analysis is discussed. Many other applicable algorithms are listed.

[1]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[2]  Yadolah Dodge,et al.  Mathematical Programming In Statistics , 1981 .

[3]  James R. Slagle,et al.  A Clustering and Data-Reorganizing Algorithm , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  M. Rao.  Cluster Analysis and Mathematical Programming , 1971 .

[5]  Jan Karel Lenstra,et al.  Technical Note - Clustering a Data Array and the Traveling-Salesman Problem , 1974, Oper. Res..

[6]  Bruce L. Golden,et al.  A statistical approach to the tsp , 1977, Networks.

[7]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[8]  R. Burkard,et al.  Numerical investigations on quadratic assignment problems , 1978 .

[9]  Azriel Rosenfeld,et al.  Progress in pattern recognition , 1985 .

[10]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[11]  Robert E. Jensen,et al.  A Dynamic Programming Algorithm for Cluster Analysis , 1969, Oper. Res..

[12]  David J. Hand,et al.  Discrimination and Classification , 1982 .

[13]  Nicos Christofides,et al.  A tree search algorithm for the p-median problem , 1982 .

[14]  J. H. Ward.  Hierarchical Grouping to Optimize an Objective Function , 1963 .

[15]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[16]  H. Sherali,et al.  Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .

[17]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[18]  Pertti Järvinen,et al.  Technical Note - A Branch-and-Bound Algorithm for Seeking the P-Median , 1972, Oper. Res..

[19]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[20]  Nicos Christofides,et al.  Algorithms for Large-scale Travelling Salesman Problems , 1972 .

[21]  Brian Everitt,et al.  Cluster analysis , 1974 .

[22]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[23]  Andrew Kusiak.  Part Families Selection Model For Flexible Manufacturing Systems. , 1983 .

[24]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[25]  Julius T. Tou,et al.  Pattern Recognition Principles , 1974 .

[26]  Robin Liggett,et al.  The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies , 1981 .

[27]  M. V. Bhat,et al.  An Efficient Clustering Algorithm , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[28]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[29]  M. Bazaraa,et al.  A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .

[30]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[31]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[32]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[33]  J. King.  Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm , 1980 .

[34]  M. L. Fisher,et al.  Probabilistic Analysis of the Planar k-Median Problem , 1980, Math. Oper. Res..

[35]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[36]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[37]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[38]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[39]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[40]  Hrishikesh D. Vinod Mathematica.  Integer Programming and the Theory of Grouping , 1969 .

[41]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .