New heuristic algorithms for the rectangular $p$-cover problem

DOI10.1051/ro/1995290100731zbMath0835.90041OpenAlexW2500991250MaRDI QIDQ4837962

Lázaro Cánovas, Blas Pelegrín

Publication date: 31 July 1995

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105098

zbMATH Keywords

clusteringheuristicTchebycheff normrectangular \(p\)- cover problemunweighted \(p\)-center

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (1)

A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem

This page was built for publication: New heuristic algorithms for the rectangular $p$-cover problem