Clustering data that are graph connected (Q1753555): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2017.02.009 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2017.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2587957618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorical data fuzzy clustering: an analysis of local search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: OR Forum—An Algorithmic Approach to Linear Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and Regression via Integer Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5379095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large attributed information networks: an efficient incremental computing approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / 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: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds and constraint propagation techniques for the clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking for edge-equitable spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-start methods for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundant constraints in the standard formulation for the clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-phased local search approach for the clique partitioning problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2017.02.009 / rank
 
Normal rank

Latest revision as of 08:20, 11 December 2024

scientific article
Language Label Description Also known as
English
Clustering data that are graph connected
scientific article

    Statements

    Clustering data that are graph connected (English)
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    combinatorial optimization
    0 references
    clustering
    0 references
    clique partitioning
    0 references
    integer programming
    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