Cluster analysis and mathematical programming
type: Item
instance of: scholarly article
title: Cluster analysis and mathematical programming
zbMATH Open document ID: 0887.90182
DOI: 10.1007/BF02614317
author: Pierre Hansen
author: Brigitte Jaumard
published in: Mathematical Programming. Series A. Series B
publication date: 1998-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1053958
zbMATH Keywords: hierarchy
zbMATH Keywords: partition
zbMATH Keywords: cluster analysis
zbMATH Keywords: survey
Wikidata QID: Q96289266
describes a project that uses: clusfind
MaRDI profile type: Publication
cites work: Finding k points with minimum diameter and related problems
cites work: Weak hierarchies associated with similarity measures - An additive clustering technique
cites work: Experiments in quadratic 0-1 programming
cites work: A note on cluster analysis and dynamic programming
cites work: Q3954671
cites work: Nonserial dynamic programming
cites work: Q4326915
cites work: Q3969900
cites work: On clustering problems with connected optima in Euclidean spaces
cites work: Q4181272
cites work: Geometric clusterings
cites work: Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
cites work: On the multiway cut polyhedron
cites work: Extended formulations for the \(A\)-cut problem
cites work: Q4083324
cites work: The basic algorithm for pseudo-Boolean programming revisited
cites work: Static and Dynamic Algorithms for k-Point Clustering Problems
cites work: Efficient algorithms for agglomerative hierarchical clustering methods
cites work: Bicriterion Cluster Analysis
cites work: Routing with time windows by column generation
cites work: Q4326918
cites work: Evaluation of a Branch and Bound Algorithm for Clustering
cites work: Fast Clustering Algorithms
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem
cites work: A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
cites work: Q4326919
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Q4745160
cites work: A Review of Hierarchical Classification
cites work: A cutting plane algorithm for a clustering problem
cites work: Facets of the clique partitioning polytope
cites work: Enumeration of the partitions with minimum diameter
cites work: Efficient algorithms for divisive hierarchical clustering with the diameter criterion
cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization
cites work: A comparison of two dual-based procedures for solving the p-median problem
cites work: Q3869362
cites work: Minimum sum of diameters clustering
cites work: Maximum sum-of-splits clustering
cites work: State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
cites work: Q4326921
cites work: Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
cites work: Espaliers: A generalization of dendrograms
cites work: Polynomial algorithms for nested univariate clustering
cites work: Q4148820
cites work: Minimizing the sum of diameters efficiently
cites work: Some applications of graph theory to clustering
cites work: Min and max hierarchical clustering using asymmetric similarity measures
cites work: Iterative projection strategies for the least‐squares fitting of tree structures to proximity data
cites work: Localizing combinatorial properties of partitions
cites work: Q4001651
cites work: A Dynamic Programming Algorithm for Cluster Analysis
cites work: Min-cut clustering
cites work: Finding Groups in Data
cites work: Q5753787
cites work: A Branch and Bound Clustering Algorithm
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Q3933032
cites work: Technical Note—Clustering a Data Array and the Traveling-Salesman Problem

Cluster analysis and mathematical programming (cites work)
cites work: Q3891599

Cluster analysis and mathematical programming (cites work)
cites work: Smallest-last ordering and clustering and graph coloring algorithms

Cluster analysis and mathematical programming (cites work)
cites work: Problem Decomposition and Data Reorganization by a Clustering Technique

Cluster analysis and mathematical programming (cites work)
cites work: Lower bounds to the graph partitioning problem through generalized linear programming and network flows

Cluster analysis and mathematical programming (cites work)
cites work: Additive clustering and qualitative factor analysis methods for similarity matrices

Cluster analysis and mathematical programming (cites work)
cites work: Mathematical classification and clustering

Cluster analysis and mathematical programming (cites work)
cites work: Q4873762

Cluster analysis and mathematical programming (cites work)
cites work: A Survey of Recent Advances in Hierarchical Clustering Algorithms

Cluster analysis and mathematical programming (cites work)
cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem

Cluster analysis and mathematical programming (cites work)
cites work: A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem

Cluster analysis and mathematical programming (cites work)
cites work: Cluster Analysis and Mathematical Programming

Cluster analysis and mathematical programming (cites work)
cites work: Q5601351

Cluster analysis and mathematical programming (cites work)
cites work: Q4395026

Cluster analysis and mathematical programming (cites work)
cites work: Q3875132

Cluster analysis and mathematical programming (cites work)
cites work: A recursive Lagrangian method for clustering problems

Cluster analysis and mathematical programming (cites work)
cites work: Q4773020

Cluster analysis and mathematical programming (cites work)
cites work: An improved algorithm for hierarchical clustering using strong components

Cluster analysis and mathematical programming (cites work)
cites work: Integer Programming and the Theory of Grouping

Cluster analysis and mathematical programming (cites work)
cites work: Algorithmic complexity: threeNP- hard problems in computational statistics

Cluster analysis and mathematical programming (full work available at URL)
full work available at URL: https://doi.org/10.1007/bf02614317

Cluster analysis and mathematical programming (OpenAlex ID)
OpenAlex ID: W2010656511