A genetic algorithm for the set covering problem
From MaRDI portal
Publication:1278326
DOI10.1016/0377-2217(95)00159-XzbMath0953.90565MaRDI QIDQ1278326
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Unnamed Item, 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, Benchmark data set with service programs to approximately solve the set covering problem, Set covering approach for reconstruction of sibling relationships, On the use of genetic algorithms to solve location problems, 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, The bi-objective covering tour problem, A GRASP algorithm to solve the unicost set covering problem, Model-based view planning, 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, 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, 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, Comparing evolutionary algorithms to the (\(1+1\))-EA, A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes, Constructing nurse schedules at large hospitals, An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing
Cites Work
- Enhancing an algorithm for set covering problems
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
