Pages that link to "Item:Q1278326"

The following pages link to A genetic algorithm for the set covering problem (Q1278326):

Displaying 35 items.

• Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
• Spherical classification of data, a new rule-based learning method (Q2038210) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• Humanitarian logistics planning for natural disaster response with Bayesian information updates (Q2438394) (← 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)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
• A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
• Comparing evolutionary algorithms to the (\(1+1\))-EA (Q2518374) (← links)
• A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand (Q2664382) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← 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)
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
• An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing (Q3430253) (← links)
• From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods (Q3564370) (← links)
• GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS (Q3631235) (← links)
• Hitting times of local and global optima in genetic algorithms with very high selection pressure (Q4987699) (← links)
• Meta-heuristic approaches to solve shortest lattice vector problem (Q5035010) (← links)
• The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← 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)
• Wartime logistics model for multi‐support unit location–allocation problem with frontline changes (Q6090511) (← links)
• Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities (Q6092512) (← links)