An efficient heuristic for the \(k\)-partitioning problem (Q6063777): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling in sports: an annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the clique partitioning problem as a maximally diverse grouping problem / 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: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate solutions to the multisource weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of obnoxious facilities location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incremental clustering algorithm based on hyperbolic smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of basic local searches for solving the minimum sum-of-squares clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of graph covering and partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning using linear and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of iterative searches for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the solution of the grey pattern quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimal solutions to several gray pattern instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a cluster of points and the grey pattern quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility Location on a Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alpha male genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing the performance of hybrid genetic algorithms by differential improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank

Revision as of 12:03, 21 August 2024

scientific article; zbMATH DE number 7776267
Language Label Description Also known as
English
An efficient heuristic for the \(k\)-partitioning problem
scientific article; zbMATH DE number 7776267

    Statements

    An efficient heuristic for the \(k\)-partitioning problem (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2023
    0 references
    clusters
    0 references
    heuristic
    0 references
    starting solutions
    0 references
    location analysis
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers