Cluster analysis and mathematical programming (Q1365055): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: clusfind / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak hierarchies associated with similarity measures - An additive clustering technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on cluster analysis and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3954671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clustering problems with connected optima in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4181272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiway cut polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for the \(A\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic algorithm for pseudo-Boolean programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and Dynamic Algorithms for k-Point Clustering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for agglomerative hierarchical clustering methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion Cluster Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with time windows by column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a Branch and Bound Algorithm for Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Clustering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review of Hierarchical Classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the partitions with minimum diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for divisive hierarchical clustering with the diameter criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two dual-based procedures for solving the p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum sum of diameters clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum sum-of-splits clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Espaliers: A generalization of dendrograms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for nested univariate clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of diameters efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of graph theory to clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min and max hierarchical clustering using asymmetric similarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative projection strategies for the least‐squares fitting of tree structures to proximity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localizing combinatorial properties of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Algorithm for Cluster Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Groups in Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Clustering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Clustering a Data Array and the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3891599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Decomposition and Data Reorganization by a Clustering Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the graph partitioning problem through generalized linear programming and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive clustering and qualitative factor analysis methods for similarity matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical classification and clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Recent Advances in Hierarchical Clustering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive Lagrangian method for clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for hierarchical clustering using strong components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and the Theory of Grouping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity: three<i>NP</i>- hard problems in computational statistics / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02614317 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010656511 / rank
 
Normal rank

Latest revision as of 11:04, 30 July 2024

scientific article
Language Label Description Also known as
English
Cluster analysis and mathematical programming
scientific article

    Statements

    Cluster analysis and mathematical programming (English)
    0 references
    0 references
    0 references
    25 May 1998
    0 references
    hierarchy
    0 references
    partition
    0 references
    cluster analysis
    0 references
    survey
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references