Algorithms for the set covering problem
From MaRDI portal
Publication:5933825
DOI10.1023/A:1019225027893zbMath0974.90006OpenAlexW1560337332MaRDI QIDQ5933825
Alberto Caprara, Matteo Fischetti, Paolo Toth
Publication date: 14 June 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019225027893
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Minimizing fleet operating costs for a container transportation company, A-priori upper bounds for the set covering problem, Give-and-take based peer-to-peer content distribution networks, A unified solving approach for two and three dimensional coverage problems in sensor networks, An efficient local search heuristic with row weighting for the unicost set covering problem, Set covering problem with conflict constraints, A multi-objective model for locating search and rescue boats, An effective and simple heuristic for the set covering problem, Set covering with almost consecutive ones property, Tactical fixed job scheduling with spread-time constraints, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Survey of quantitative methods in construction, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, Relaxation heuristics for the set multicover problem with generalized upper bound constraints, Cutting plane versus compact formulations for uncertain (integer) linear programs, Discrete dynamical system approaches for Boolean polynomial optimization, Robust min-max regret covering problems, A binary cat swarm optimization algorithm for the non-unicost set covering problem, Solving a bicriteria problem of optimal service centers location, The robust set covering problem with interval data, A hybrid heuristic for the set covering problem, A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, Proportional and maxmin fairness for the sensor location problem with chance constraints, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, A binary monkey search algorithm variation for solving the set covering problem, Facility location for large-scale emergencies, Boolean-controlled systems via receding horizon and linear programing, A note on a symmetrical set covering problem: the lottery problem, A set-cover-based approach for the test-cost-sensitive attribute reduction problem, Robust strategic planning for mobile medical units with steerable and unsteerable demands, Benders decomposition for set covering problems. Almost satisfying the consecutive ones property, Conditional sampling for spectrally discrete max-stable random fields, Multi-period stochastic covering location problems: modeling framework and solution approach, An exact solution approach for the interdiction median problem with fortification, Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems, Computing the spark: mixed-integer programming for the (vector) matroid girth problem, A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM, Decomposition and dynamic cut generation in integer linear programming, An electromagnetism metaheuristic for the unicost set covering problem, Capacity inverse minimum cost flow problem, Set covering approach for reconstruction of sibling relationships, A set covering based approach to find the reduct of variable precision rough set, Computational experience with general cutting planes 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, A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company, Model-based view planning, Bimaterial 3D printing using galvanometer scanners, Red-blue covering problems and the consecutive ones property, 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, On the resolution and optimization of a system of fuzzy relational equations with sup-\(T\) composition, On interval and circular-arc covering problems, Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm, Exploring further advantages in an alternative formulation for the set covering problem, A set covering based matheuristic for a real‐world city logistics problem, Variable employee productivity in workforce scheduling, A set covering approach for multi-depot train driver scheduling, Mathematical optimization ideas for biodiversity conservation
Uses Software
