A cutting plane algorithm for a clustering problem
- 1 August 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 45 (1-3) , 59-96
- https://doi.org/10.1007/bf01589097
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Solving matching problems with linear programmingMathematical Programming, 1985
- Ein Subgradientenverfahren zur Klassifikation qualitativer DatenOR Spectrum, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- Analyse qualitativer Daten: Einführung und ÜbersichtOR Spectrum, 1984
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- The median procedure in cluster analysis and social choice theoryMathematical Social Sciences, 1981
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Graph Theory with ApplicationsPublished by Springer Nature ,1976