A branch-and-bound approach using polyhedral results for a clustering problem

INFORMS Journal on Computing

Volumn 9, Issue 1, 1997, Pages 30-42

  Palubeckis, Gintaras ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Branch and bound; Heuristics; Integer; Polyhedral combinatorics

Indexed keywords

EID: 0002683074     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.9.1.30     Document Type: Article

References (5)

1. J.-P. BARTHÉLEMY and B. LECLERC, 1995. The Median Procedure for Partitions, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 19: Partitioning Data Sets, American Mathematical Society, Providence, RI, pp. 3-34.
2. J.-P. BARTHÉLEMY, B. LECLERC, and B. MONJARDET, 1986. On the Use of Ordered Sets in Problems of Comparison and Consensus of Classifications, Journal of Classification 3, 187-224.
3. J.-P. BARTHÉLEMY and B. MONJARDET, 1981. The Median Procedure in Cluster Analysis and Social Choice Theory, Mathematical Social Sciences 1, 235-267.
4. J.-P. BARTHÉLEMY and B. MONJARDET, 1988. The Median Procedure in Data Analysis: New Results and Open Problems, in Classification and Related Methods of Data Analysis, H.H. Bock (ed.), First Conference of the International Federation of Classification Societies, Rheinisch-Westfälische Technische Hochschule Aachen, June 29-July 1, 1987, North-Holland, Amsterdam, pp. 309-316.
5. J.A. BONDY and U.S.R. MURTY, 1976. Graph Theory with Applications, Macmillan, London.