An algorithm for set covering problem
From MaRDI portal
Recommendations
- Algorithms for the set covering problem
- A heuristic algorithm for the set covering problem
- An approach to the solution of the set-covering problem
- Enhancing an algorithm for set covering problems
- Problems and algorithms for covering arrays via set covers
- A Heuristic Method for the Set Covering Problem
- An Efficient Algorithm for Finding an Irredundant Set Cover
- A set coverage problem
- An algorithm for the difference between set covers
- Algorithms for large scale set covering problems
Cites work
- Algorithms for large scale set covering problems
- An Algorithm for Large Set Partitioning Problems
- An Analysis of Private and Public Sector Location Models
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Cutting planes from conditional bounds: A new approach to set covering
- scientific article; zbMATH DE number 3643033 (Why is no real title available?)
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- Note—A Computational Survey of Methods for the Set Covering Problem
- On trivial and binding constraints in programming problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Set-Covering Problem: A New Implicit Enumeration Algorithm
Cited in
(82)- Computational experience with general cutting planes for the set covering problem
- An O(m n) algorithm for regular set-covering problems
- An interior point algorithm to solve computationally difficult set covering problems
- Enhancing an algorithm for set covering problems
- The multicovering problem
- An adaptation of SH heuristic to the location set covering problem
- A genetic algorithm for the set covering problem
- Simple Lagrangian heuristic for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- Algorithms for large scale set covering problems
- State space relaxation for set covering problems related to bus driver scheduling
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- A surrogate heuristic for set covering problems
- Algorithms for railway crew management
- Solving large set covering problems for crew scheduling
- Graph theoretic relaxations of set covering and set partitioning problems
- Hybrid heuristic algorithms for set covering.
- The composition of semi-finished inventories at a solid board plant.
- A neural network for the minimum set covering problem
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- On a linearization technique for solving the quadratic set covering problem and variations
- Improved handling of uncertainty and robustness in set covering problems
- Lagrangean heuristics for location problems
- A special case of set covering problems
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks
- Column generation extensions of set covering greedy heuristics
- Optimized item selection to boost exploration for recommender systems
- Set covering problem with conflict constraints
- A theoretical justification of the set covering greedy heuristic of Caprara et al.
- An improved configuration checking-based algorithm for the unicost set covering problem
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- An algorithm for binary linear chance-constrained problems using IIS
- A 3-flip neighborhood local search for the set covering problem
- The set covering problem revisited: an empirical study of the value of dual information
- A fast approximation algorithm for solving the complete set packing problem
- The set covering problem: Complexity, algorithms, experiments
- Solution of problems of minimal set partition and set covering
- An adaptive memetic algorithm for solving the set covering problem
- Implementation algorithms for solution of covering problems and analysis of their efficiency
- Solving set covering problems of large dimension
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- Opening a web site at which one can get a benchmark input data set to solve the set covering problem
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Tabu search-based metaheuristic algorithm for large-scale set covering problems
- An approach to the solution of the set-covering problem
- A hybrid heuristic for the set covering problem
- scientific article; zbMATH DE number 2000148 (Why is no real title available?)
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- scientific article; zbMATH DE number 2102648 (Why is no real title available?)
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- Computer Solutions to Minimum-Cover Problems
- Solving a fuzzy set-covering problem
- On a generalized sequential partially covering problem
- Set covering approach for reconstruction of sibling relationships
- An efficient mean field approach to the set covering problem
- Matheuristics: survey and synthesis
- Location-allocation analysis of humanitarian distribution plans: a case of united nations humanitarian response depots
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- A binary monkey search algorithm variation for solving the set covering problem
- Algorithm for solving the generalized set cover problem for a special class of problems
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- A meta-heuristic extension of the Lagrangian heuristic framework
- An optimal algorithm for variable knockout problems
- Integrating optimized item selection with active learning for continuous exploration in recommender systems
- On a geometric graph-covering problem related to optimal safety-landing-site location
- Experiments with LAGRASP heuristic for set \(k\)-covering
- Heuristics for the weighted total domination problem
- Ensemble machine learning-based stopping rule for greedy randomized adaptive search procedure
- Exploring further advantages in an alternative formulation for the set covering problem
- An effective and simple heuristic for the set covering problem
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- A variable neighborhood search algorithm for the multimode set covering problem
- Solving the set cover problem on a supercomputer
- An electromagnetism metaheuristic for the unicost set covering problem
This page was built for publication: An algorithm for set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823139)
