Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: final exam scheduling / 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.1007/s11590-015-0869-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080943874 / 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: Noising methods for a clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of balanced MBA student teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742505 / 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: Variable neighborhood search for maximum diverse grouping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group technology problems via clique partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Partitioning for Clustering: A Comparison with<i>K</i>-Means and Latent Class Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical comparison of heuristic methods for creating maximally diverse groups / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:46, 14 July 2024

scientific article
Language Label Description Also known as
English
Solving the clique partitioning problem as a maximally diverse grouping problem
scientific article

    Statements

    Solving the clique partitioning problem as a maximally diverse grouping problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2017
    0 references
    clique partitioning
    0 references
    maximum diverse grouping problem
    0 references
    variable neighborhood search
    0 references

    Identifiers