Abstract
We present an iterated hyperplane search approach for the budgeted maximum coverage problem. Our algorithm relies on the idea of searching on specific areas identified by cardinality-constrained hyperplanes. It combines three complementary procedures: a tabu search procedure to identify a promising hyperplane, a hyperplane search procedure to examine candidate solutions on cardinality-constrained hyperplanes and a dedicated perturbation procedure to ensure the diversification of the search. We show the competitiveness of the algorithm on 30 benchmark instances and present experiments to study the key components of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
