An efficient heuristic for the \(k\)-partitioning problem

DOI10.1007/s43069-023-00249-wMaRDI QIDQ6063777

Pawel Jan Kalczynski, Zvi Goldstein, Zvi Drezner

Publication date: 12 December 2023

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

zbMATH Keywords

heuristicclusterslocation analysisstarting solutions

Mathematics Subject Classification ID

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

Cites Work

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

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