Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities

DOI10.1007/978-3-031-41229-5_4OpenAlexW4388018767MaRDI QIDQ6119446

Anton Vladimirovich Ushakov, Igor' Leonidovich Vasilyev, Tat'yana Vladimirovna Gruzdeva, Aleksander Belykh

Publication date: 22 March 2024

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-41229-5_4

zbMATH Keywords

local searchfacility locationVNSgreedy algorithmsbase stations locationpartial set covering

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• An effective and simple heuristic for the set covering problem
• Computational experience with general cutting planes for the set covering problem
• On the 0,1 facets of the set covering polytope
• On the facial structure of the set covering polytope
• Facets and lifting procedures for the set covering polytope
• Enhancing an algorithm for set covering problems
• A genetic algorithm for the set covering problem
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• A Lagrangian-based heuristic for large-scale set covering problems
• A surrogate heuristic for set covering problems
• Variable neighborhood search
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• An algorithm for set covering problem
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem
• Set Partitioning: A survey
• The Set-Covering Problem: A New Implicit Enumeration Algorithm
• Genetic algorithms applied to computationally difficult set covering problems
• Note: A local-search heuristic for large set-covering problems
• A Heuristic Method for the Set Covering Problem
• Covering Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The Location of Emergency Service Facilities
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Algorithms for the set covering problem
• Variable neighborhood search: Principles and applications

This page was built for publication: Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities