Algorithms for the set covering problem
From MaRDI portal
Recommendations
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- A Heuristic Method for the Set Covering Problem
- The set covering problem: Complexity, algorithms, experiments
- Algorithms for large scale set covering problems
- A heuristic algorithm for the set covering problem
Cited in
(82)- A set covering based approach to find the reduct of variable precision rough set
- A fast approximation algorithm for solving the complete set packing problem
- A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company
- A three-phase methodology for developing or evaluating bank networks
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Exact and heuristic approaches for the set cover with pairs problem
- A new approach for solving set covering problem using jumping particle swarm optimization method
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information
- A-priori upper bounds for the set covering problem
- A comprehensive survey of the reviewer assignment problem
- Fifty years of location theory -- a selective review
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- scientific article; zbMATH DE number 4106856 (Why is no real title available?)
- Red-blue covering problems and the consecutive ones property
- Set covering approach for reconstruction of sibling relationships
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- An effective and simple heuristic for the set covering problem
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Robust strategic planning for mobile medical units with steerable and unsteerable demands
- Multi-period stochastic covering location problems: modeling framework and solution approach
- A unified solving approach for two and three dimensional coverage problems in sensor networks
- Set covering with almost consecutive ones property
- Boolean-controlled systems via receding horizon and linear programing
- Computational experience with approximation algorithms for the set covering problem
- On the resolution and optimization of a system of fuzzy relational equations with sup-\(T\) composition
- Give-and-take based peer-to-peer content distribution networks
- The set covering problem: Complexity, algorithms, experiments
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
- Solution techniques for the large set covering problem
- Model-based view planning
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- An efficient local search heuristic with row weighting for the unicost set covering problem
- Robust min-max regret covering problems
- Conditional sampling for spectrally discrete max-stable random fields
- Set covering problem with conflict constraints
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Survey of quantitative methods in construction
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- A set covering based matheuristic for a real-world city logistics problem
- A multi-objective model for locating search and rescue boats
- Discrete dynamical system approaches for Boolean polynomial optimization
- Facility location for large-scale emergencies
- Tactical fixed job scheduling with spread-time constraints
- The robust set covering problem with interval data
- An electromagnetism metaheuristic for the unicost set covering problem
- Algorithms of optimal set covering on the planar R^2
- scientific article; zbMATH DE number 2079889 (Why is no real title available?)
- A note on a symmetrical set covering problem: the lottery problem
- Computational experience with general cutting planes for the set covering problem
- Hybrid heuristic algorithms for set covering.
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- Exploring further advantages in an alternative formulation for the set covering problem
- An exact algorithm for the minimum gap graph partitioning problem
- An algorithm for set covering problem
- An optimal algorithm for variable knockout problems
- Breaking symmetries from a set-covering perspective
- The forget-set identification problem
- Solving a bicriteria problem of optimal service centers location
- A hybrid heuristic for the set covering problem
- A binary monkey search algorithm variation for solving the set covering problem
- A set covering approach for multi-depot train driver scheduling
- On interval and circular-arc covering problems
- Bimaterial 3D printing using galvanometer scanners
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
- Proportional and maxmin fairness for the sensor location problem with chance constraints
- A set-cover-based approach for the test-cost-sensitive attribute reduction problem
- Capacity inverse minimum cost flow problem
- Mathematical optimization ideas for biodiversity conservation
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- Decomposition and dynamic cut generation in integer linear programming
- Introducing covering problems for the electronic wafer test
- Minimizing fleet operating costs for a container transportation company
- An exact solution approach for the interdiction median problem with fortification
- A nested decomposition approach for a large scale set covering problem: a model with a variety of applications in Industry 4.0
- The set covering problem revisited: an empirical study of the value of dual information
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- Variable employee productivity in workforce scheduling
- Heuristics for the weighted total domination problem
This page was built for publication: Algorithms for the set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933825)
