Analysis of integer programming formulations of clustering problems
- 1 February 1984
- journal article
- Published by Elsevier in Image and Vision Computing
- Vol. 2 (1) , 35-40
- https://doi.org/10.1016/0262-8856(84)90042-8
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A branch‐and‐bound‐based heuristic for solving the quadratic assignment problemNaval Research Logistics Quarterly, 1983
- The Quadratic Assignment Problem: An Experimental Evaluation of Solution StrategiesManagement Science, 1981
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problemNaval Research Logistics Quarterly, 1980
- Numerical investigations on quadratic assignment problemsNaval Research Logistics Quarterly, 1978
- A Clustering and Data-Reorganizing AlgorithmIEEE Transactions on Systems, Man, and Cybernetics, 1975
- Technical Note—Clustering a Data Array and the Traveling-Salesman ProblemOperations Research, 1974
- Problem Decomposition and Data Reorganization by a Clustering TechniqueOperations Research, 1972
- Quadratic Assignment Problem Algorithms and the Location of Indivisible FacilitiesManagement Science, 1966
- The Quadratic Assignment ProblemManagement Science, 1963
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960