An exact algorithm for the maximal covering problem
From MaRDI portal
Recommendations
- An approximation algorithm for the total covering problem
- An exact algorithm for a class of geometric set-cover problems
- Efficient algorithms for the max \(k\)-vertex cover problem
- Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
- scientific article; zbMATH DE number 5371016
- A branch-and-cut algorithm for the maximum covering cycle problem
- On approximation of max-vertex-cover
- Exact algorithms for set multicover and multiset multicover problems
- An exact algorithm for the maximum clique problem
Cited in
(33)- Fuzzy logic based algorithms for maximum covering location problems
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A VNS-LP algorithm for the robust dynamic maximal covering location problem
- Intelligent-guided adaptive search for the maximum covering location problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- On the overlap area of a disk and a piecewise circular domain
- A constructive proof of swap local search worst-case instances for the maximum coverage problem
- A procedure for solution of the problem of optimal covering of a finite set
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- A branch-and-cut algorithm for the maximum covering cycle problem
- Solving the maximal covering location problem with heuristic concentration
- An optimal algorithm for the minimum disc cover problem
- Iterated greedy algorithms for the maximal covering location problem
- A mean-shift algorithm for large-scale planar maximal covering location problems
- A hybrid method for the probabilistic maximal covering location-allocation problem
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
- Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems
- scientific article; zbMATH DE number 8033 (Why is no real title available?)
- scientific article; zbMATH DE number 1226311 (Why is no real title available?)
- scientific article; zbMATH DE number 2000148 (Why is no real title available?)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- A practical heuristic for maximum coverage in large-scale continuous location problem
- The Maximal Conditional Covering Problem
- The Exact Subset MultiCover problem
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- A hybrid adaptive iterated local search heuristic for the maximal covering location problem
- Presolving and cutting planes for the generalized maximal covering location problem
- Maximal covering location with partial coverage for second-level specialized health care services
- Autonomous data detection and inspection with a fleet of UAVs
- Benders decomposition for congested partial set covering location with uncertain demand
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- Bayesian coverage optimization models
This page was built for publication: An exact algorithm for the maximal covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883162)
