New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2013.02.011 / 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.2013.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986827871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Clustering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering of microarray data via clique partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques and clustering: A combinatorial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique partitioning problem: Facets and patching facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Partitions of a Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group technology problems via clique partitioning / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2013.02.011 / rank
 
Normal rank

Latest revision as of 16:59, 18 December 2024

scientific article
Language Label Description Also known as
English
New bounds and constraint propagation techniques for the clique partitioning problem
scientific article

    Statements

    New bounds and constraint propagation techniques for the clique partitioning problem (English)
    0 references
    0 references
    0 references
    22 April 2014
    0 references
    clique partitioning
    0 references
    constraint propagation
    0 references
    branch and bound
    0 references

    Identifiers

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