An efficient heuristic for the k-partitioning problem

DOI10.1007/S43069-023-00249-WMaRDI QIDQ6063777zbMATH OpenFDO

Authors Pawel Kalczynski, Zvi Goldstein, Zvi Drezner

Publication date 12 December 2023

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S43069-023-00249-W

zbMATH Keywords

clustersheuristiclocation analysisstarting solutions

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The \(k\)-partitioning problem
• scientific article; zbMATH DE number 1185313
• w-efficient partitions and the solution of the sequential clustering problem
• One-Half Approximation Algorithms for the k-Partition Problem
• Lower bounds and heuristic algorithms for the k_i-partitioning problem

Cites work

• A cutting plane algorithm for a clustering problem
• An incremental clustering algorithm based on hyperbolic smoothing
• An overview of graph covering and partitioning
• Assignment Problems and the Location of Economic Activities
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Comparison of iterative searches for the quadratic assignment problem
• Enhancing the performance of hybrid genetic algorithms by differential improvement
• Exact algorithms for the solution of the grey pattern quadratic assignment problem
• Exact and approximate solutions to the multisource weber problem
• Facility Location on a Sphere
• Finding a cluster of points and the grey pattern quadratic assignment problem
• Finding optimal solutions to several gray pattern instances
• Graph partitioning using linear and semidefinite programming
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 1803767 (Why is no real title available?)
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1455125 (Why is no real title available?)
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Optimization by simulated annealing
• Review of basic local searches for solving the minimum sum-of-squares clustering problem
• Review of obnoxious facilities location problems
• Scheduling in sports: an annotated bibliography
• Solving the clique partitioning problem as a maximally diverse grouping problem
• The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
• The alpha male genetic algorithm
• The quadratic assignment problem

Cited in

(2)

• The \(k\)-partitioning problem
• Reviewing extensions and solution methods of the planar Weber single facility location problem

This page was built for publication: An efficient heuristic for the \(k\)-partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063777)