An algorithm for set covering problem
From MaRDI portal
Publication:1823139
DOI10.1016/0377-2217(87)90141-XzbMath0679.90039OpenAlexW1977723771MaRDI QIDQ1823139
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(87)90141-x
Numerical mathematical programming methods (65K05) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)
Related Items
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, A surrogate heuristic for set covering problems, Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem, An efficient local search heuristic with row weighting for the unicost set covering problem, Set covering problem with conflict constraints, An effective and simple heuristic for the set covering problem, A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Algorithms for railway crew management, Solving large set covering problems for crew scheduling, A theoretical justification of the set covering greedy heuristic of Caprara et al., A hybrid 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, Graph theoretic relaxations of set covering and set partitioning problems, Matheuristics: survey and synthesis, An algorithm for binary linear chance-constrained problems using IIS, 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, Improved handling of uncertainty and robustness in set covering problems, A binary monkey search algorithm variation for solving the set covering problem, Hybrid heuristic algorithms for set covering., The composition of semi-finished inventories at a solid board plant., An improved configuration checking-based algorithm for the unicost set covering problem, Enhancing an algorithm for set covering problems, Experiments with LAGRASP heuristic for set \(k\)-covering, The multicovering problem, Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems, A 3-flip neighborhood local search for the set covering problem, Optimal RSUs placement with delay bounded message dissemination in vehicular networks, An electromagnetism metaheuristic for the unicost set covering problem, Solving a fuzzy set-covering problem, An efficient mean field approach to the set covering problem, Set covering approach for reconstruction of sibling relationships, 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, Lagrangean heuristics for location problems, Solving the non-unicost set covering problem by using cuckoo search and black hole optimization, 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, A self-adaptive biogeography-based algorithm to solve the set covering problem, A neural network for the minimum set covering problem, A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem, Exploring further advantages in an alternative formulation for the set covering problem, Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, Column generation extensions of set covering greedy heuristics, State space relaxation for set covering problems related to bus driver scheduling, A tabu search approach to the constraint satisfaction problem as a general problem solver, Optimized item selection to boost exploration for recommender systems
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for large scale set covering problems
- On Trivial and Binding Constraints in Programming Problems
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- Cutting planes from conditional bounds: A new approach to set covering
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- An Algorithm for Large Set Partitioning Problems
- Note—A Computational Survey of Methods for the Set Covering Problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- The Set-Covering Problem: A New Implicit Enumeration Algorithm
- An Analysis of Private and Public Sector Location Models
