Branch-and-cut approaches for \(p\)-cluster editing (Q505422): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.10.026 / 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.dam.2016.10.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560364549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-parameterized Cluster Editing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grouping Multidimensional Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Golden Ratio Parameterized Algorithm for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going Weighted: Parameterized Algorithms for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for cluster editing: Evaluation and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster parameterized cluster deletion and cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cluster Editing Problem: Implementations and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering with a fixed number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated generation of search tree algorithms for hard graphs modification problems / 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: A More Effective Linear Kernelization for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer linear programming formulations for the software clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414513 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.10.026 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut approaches for \(p\)-cluster editing
scientific article

    Statements

    Branch-and-cut approaches for \(p\)-cluster editing (English)
    0 references
    23 January 2017
    0 references
    cluster editing
    0 references
    valid inequalities
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers