A genetic algorithm for the set covering problem
From MaRDI portal
Recommendations
- A genetic algorithm with a non-binary representation for the set covering problem
- A Genetic Algorithm for the Set Covering Problem
- An improved genetic algorithm for the set covering problem
- An empirical study of hybrid genetic algorithms for the set covering problem
- Genetic algorithms applied to computationally difficult set covering problems
Cites work
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- Enhancing an algorithm for set covering problems
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
Cited in
(only showing first 100 items - show all)- Model-based view planning
- Heuristics for the variable sized bin-packing problem
- Fuzzy minimum weight edge covering problem
- An adaptive heuristic algorithm for VLSI test vectors selection
- Computational experience with approximation algorithms for the set covering problem
- A genetic algorithm for the generalised assignment problem
- Algorithms for railway crew management
- Solving large set covering problems for crew scheduling
- Hybrid heuristic algorithms for set covering.
- Evaluation of reliability bounds by set covering models.
- Approximate algorithms for constrained circular cutting problems
- An indirect genetic algorithm for a nurse-scheduling problem
- Fuzzy dispatching model and genetic algorithms for railyards operations
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- Heuristics for cardinality constrained portfolio optimization
- A framework for the description of evolutionary algorithms
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- Application of heuristic methods for conformance test selection
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Application of a hybrid genetic algorithm to airline crew scheduling
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Solving the wire-harness design problem at a European car manufacturer
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks
- A genetic algorithm for the maximum 2-packing set problem
- Spherical classification of data, a new rule-based learning method
- An improved configuration checking-based algorithm for the unicost set covering 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 set covering approach for multi-depot train driver scheduling
- A simulated evolution-based solution of the cover problem
- Humanitarian logistics planning for natural disaster response with Bayesian information updates
- A multiperiod set covering location model for dynamic redeployment of ambulances
- A note on a symmetrical set covering problem: the lottery problem
- Distance preserving recombination operator for Earth observation satellites operations scheduling
- A 3-flip neighborhood local search for the set covering problem
- A hybrid heuristic for the maximum clique problem
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack 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
- Comparing evolutionary algorithms to the (\(1+1\))-EA
- Metaheuristic applications on discrete facility location problems: a survey
- A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran
- A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- An adaptive memetic algorithm for solving the set covering problem
- Hierarchical differential evolution for minimal cut sets identification: application to nuclear safety systems
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Constructing nurse schedules at large hospitals
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- An efficient local search heuristic with row weighting for the unicost set covering problem
- An empirical study of hybrid genetic algorithms for the set covering problem
- An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing
- From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
- GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
- Solving a bicriteria problem of optimal service centers location
- The robust set covering problem with interval data
- Edge covering problem under hybrid uncertain environments
- A hybrid heuristic for the set covering problem
- Genetic algorithms applied to computationally difficult set covering problems
- A genetic algorithm with a non-binary representation for the set covering problem
- An indirect genetic algorithm for set covering problems
- A Genetic Algorithm for the Set Covering Problem
- scientific article; zbMATH DE number 1910920 (Why is no real title available?)
- An improved genetic algorithm for the set covering problem
- Hitting times of local and global optima in genetic algorithms with very high selection pressure
- Meta-heuristic approaches to solve shortest lattice vector problem
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- scientific article; zbMATH DE number 2230221 (Why is no real title available?)
- Benchmark data set with service programs to approximately solve the set covering problem
- Set covering approach for reconstruction of sibling relationships
- An efficient mean field approach to the set covering problem
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study
- Flight graph based genetic algorithm for crew scheduling in airlines
- On the use of genetic algorithms to solve location problems
- Wartime logistics model for multi‐support unit location–allocation problem with frontline changes
- Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- Location and design decisions of facilities in a distribution system with elastic customer demand
- Exact and heuristic algorithms for the interval data robust assignment problem
- An evolutionary approach for the nurse rerostering problem
- A new genetic algorithm encoding for coalition structure generation problems
- An optimal algorithm for variable knockout problems
- Characterisation of conserved and reacting moieties in chemical reaction networks
- Introducing covering problems for the electronic wafer test
- Heuristics for the weighted total domination problem
- Fifty years of location theory -- a selective review
- Exploring further advantages in an alternative formulation for the set covering problem
- Minimizing fleet operating costs for a container transportation company
- An effective and simple heuristic for the set covering problem
- Developing effective meta-heuristics for a probabilistic location model via experimental design
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
This page was built for publication: A genetic algorithm for the set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278326)
