Pages that link to "Item:Q1278326"
From MaRDI portal
The following pages link to A genetic algorithm for the set covering problem (Q1278326):
Displayed 41 items.
- Minimizing fleet operating costs for a container transportation company (Q819069) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Developing effective meta-heuristics for a probabilistic location model via experimental design (Q856202) (← links)
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil (Q863989) (← links)
- The bi-objective covering tour problem (Q868132) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Model-based view planning (Q1008495) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
- Evaluation of reliability bounds by set covering models. (Q1424481) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- An indirect genetic algorithm for a nurse-scheduling problem (Q1433170) (← links)
- Fuzzy dispatching model and genetic algorithms for railyards operations (Q1577766) (← links)
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem (Q1579122) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
- A framework for the description of evolutionary algorithms (Q1584807) (← links)
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study (Q1847206) (← links)
- Application of heuristic methods for conformance test selection (Q1847243) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- Application of a hybrid genetic algorithm to airline crew scheduling (Q1915974) (← links)
- A multiperiod set covering location model for dynamic redeployment of ambulances (Q2456639) (← links)
- A note on a symmetrical set covering problem: the lottery problem (Q2462109) (← links)
- Distance preserving recombination operator for Earth observation satellites operations scheduling (Q2481604) (← links)
- A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
- A hybrid heuristic for the maximum clique problem (Q2491328) (← links)
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
- Comparing evolutionary algorithms to the (\(1+1\))-EA (Q2518374) (← links)
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes (Q3044033) (← links)
- Constructing nurse schedules at large hospitals (Q3044038) (← links)
- An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing (Q3430253) (← links)
- (Q5708509) (← links)
- Benchmark data set with service programs to approximately solve the set covering problem (Q5756398) (← links)
- Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
- An efficient mean field approach to the set covering problem (Q5943937) (← links)
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study (Q5945206) (← links)
- Flight graph based genetic algorithm for crew scheduling in airlines (Q5946304) (← links)
- On the use of genetic algorithms to solve location problems (Q5959394) (← links)