The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Cluster analysis and mathematical programming
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Harary, F. (1969) · Cited by 10,739
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Self-citationAn Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
On Nonlinear Fractional Programming
Dinkelbach, W. (1967) · Management Science · doi:10.1287/mnsc.13.7.492 · Cited by 3,139
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
A Linear Programming Approach to the Cutting-Stock Problem
Gilmore, P. C., & Gomory, R. E. (1961) · Operations Research · doi:10.1287/opre.9.6.849 · Cited by 2,024
A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
Lance, G. N., & Williams, W. T. (1967) · The Computer Journal · doi:10.1093/comjnl/9.4.373 · Cited by 1,696
Sibson, R., & Hartigan, J. A. (1976) · Applied Statistics · doi:10.2307/2346526 · Cited by 1,435
Minimum Spanning Trees and Single Linkage Cluster Analysis
Gower, J. C., & Ross, G. J. S. (1969) · Applied Statistics · doi:10.2307/2346439 · Cited by 1,223
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
Efficient algorithms for agglomerative hierarchical clustering methods
Day, W. H. E., & Edelsbrunner, H. (1984) · Journal of Classification · doi:10.1007/bf01890115 · Cited by 971
A Dual-Based Procedure for Uncapacitated Facility Location
Erlenkotter, D. (1978) · Operations Research · doi:10.1287/opre.26.6.992 · Cited by 912
Graph Theory: An Algorithmic Approach
Kay, E. (1976) · Journal of the Operational Research Society · doi:10.1057/jors.1976.202 · Cited by 902
Cormack, R. M. (1971) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344237 · Cited by 803
Mathematical Classification and Clustering
Mirkin, B. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600836 · Cited by 563
A Least Squares Algorithm for Fitting Additive Trees to Proximity Data
De Soete, G. (1983) · Psychometrika · doi:10.1007/bf02293884 · Cited by 491
The Recovery of Trees from Measures of Dissimilarity
Buneman, P. (1971) · Cited by 483
Shepard, R. N., & Arabie, P. (1979) · Psychological Review · doi:10.1037//0033-295x.86.2.87 · Cited by 476
Mathematical Classification and Clustering
Mirkin, B. (1996) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4613-0457-9 · Cited by 464
Cluster Analysis Algorithms for Data Reduction and Classification of Objects
Ling, R. F. (1981) · Technometrics · doi:10.1080/00401706.1981.10487693 · Cited by 417
Bulletin of Mathematical Biology
(2013) · Bulletin of Mathematical Biology · doi:10.1007/11538.1522-9602 · Cited by 409
A Review of Hierarchical Classification
Gordon, A. D. (1987) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981629 · Cited by 380
Cluster Analysis and Mathematical Programming
Rao, M. R. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482319 · Cited by 377
Routing with time windows by column generation
Desrosiers, J., Soumis, F., & Desrochers, M. (1984) · Networks · doi:10.1002/net.3230140406 · Cited by 366
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6010-2 · Cited by 341
Roof duality, complementation and persistency in quadratic 0–1 optimization
Hammer, P. L., Hansen, P., & Simeone, B. (1984) · Mathematical Programming · doi:10.1007/bf02612354 · Cited by 316
Self-citationOn the Complexity of Clustering Problems
Brucker, P. (1978) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-95322-4_5 · Cited by 266
Integer Programming and the Theory of Grouping
Vinod, H. D. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10500990 · Cited by 245
Johnson, E. L., Mehrotra, A., & Nemhauser, G. L. (1993) · Mathematical Programming · doi:10.1007/bf01585164 · Cited by 225
A Branch and Bound Clustering Algorithm
Koontz, W. L. G., Narendra, P. M., & Fukunaga, K. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224336 · Cited by 197
Some Applications of Graph Theory to Clustering
Hubert, L. J. (1974) · Psychometrika · doi:10.1007/bf02291704 · Cited by 157
Algorithmic complexity: three NP - hard problems in computational statistics
Welch, W. J. (1982) · Journal of Statistical Computation and Simulation · doi:10.1080/00949658208810560 · Cited by 149
Exploratory and multivariate data analysis
(1992) · Choice Reviews Online · doi:10.5860/choice.29-5173 · Cited by 135
A Dynamic Programming Algorithm for Cluster Analysis
Jensen, R. E. (1969) · Operations Research · doi:10.1287/opre.17.6.1034 · Cited by 131
Complete-Link Cluster Analysis by Graph Coloring
Hansen, P., & Delattre, M. (1978) · Journal of the American Statistical Association · doi:10.1080/01621459.1978.10481589 · Cited by 128
Self-citationEfficient algorithms for divisive hierarchical clustering with the diameter criterion
Guénoche, A., Hansen, P., & Jaumard, B. (1991) · Journal of Classification · doi:10.1007/bf02616245 · Cited by 113
Self-citationDelattre, M., & Hansen, P. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4767027 · Cited by 111
Self-citationConstrained Nonlinear 0-1 Programming
Hansen, P., Jaumard, B., & Mathon (1989) · Les Cahiers du GERAD · Cited by 101
Self-citationOptimisation en analyse ordinale des données
Marcotorchino, J.-F., & Michaud, P. (1979) · Masson eBooks · Cited by 98
Capoyleas, V., Rote, G., & Woeginger, G. J. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90007-l · Cited by 98
The basic algorithm for pseudo-Boolean programming revisited
Crama, Y., Hansen, P., & Jaumard, B. (1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90142-y · Cited by 78
Self-citationA reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
Gascuel, O., & Levy, D. (1996) · Journal of Classification · doi:10.1007/bf01202585 · Cited by 23
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
Hansen, P., Jaumard, B., & de Aragão, M. P. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00059-3 · Cited by 21
Self-citationRosenstiehl, P. (1966) · HAL · Cited by 19
Cited by
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Self-citationNP-hardness of Euclidean sum-of-squares clustering
Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009) · Machine Learning · doi:10.1007/s10994-009-5103-0 · Cited by 867
Self-citationBoros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
A clustering algorithm based on graph connectivity
Hartuv, E., & Shamir, R. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00142-3 · Cited by 480
Optimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.08.045 · Cited by 365
Metadata
- Authors
- Hansen, P., & Jaumard, B.
- Venue
- Mathematical Programming
- Published
- 1997-10
- Volume
- 79
- Issue
- 1-3
- Pages
- 191-215
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2010656511
- Cited by
- 646
- References
- 50
- FWCI
- 7.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.