New heuristic algorithms for the rectangular p-cover problem

DOI10.1051/RO/1995290100731MaRDI QIDQ4837962zbMATH OpenOpenAlexFDO

Authors Lázaro Cánovas, B. Pelegrin

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)

Recommendations

• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• Algorithms for Rectangular Covering Problems
• New heuristics for the conditional covering problem
• scientific article; zbMATH DE number 3918386
• Heuristic approaches to the capacitated square covering problem
• A New Efficient Heuristic for the Minimum Set Covering Problem
• A new heuristic algorithm for rectangle packing
• Complexities of efficient solutions of rectilinear polygon cover problems
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
• A new worst-case bound of heuristic for set covering problem

Cited in

(4)

• scientific article; zbMATH DE number 34574 (Why is no real title available?)
• New heuristics for the conditional covering problem
• The p-cover problem
• 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

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