Pages that link to "Item:Q4452894"
From MaRDI portal
The following pages link to A Gentle Introduction to Memetic Algorithms (Q4452894):
Displayed 27 items.
- Using and extending fix-and-relax to solve maritime inventory routing problems (Q356520) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Evolutionary optimization: pitfalls and booby traps (Q389022) (← links)
- Exact and approximate algorithms for variable selection in linear discriminant analysis (Q452539) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis (Q840098) (← links)
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170) (← links)
- The service allocation problem at the Gioia Tauro maritime terminal (Q852990) (← links)
- Repulsive assignment problem (Q963661) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
- The \(k\)-feature set problem is \(W[2]\)-complete (Q1877698) (← links)
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem (Q1928502) (← links)
- Industrial aspects and literature survey: Combined inventory management and routing (Q2270436) (← links)
- Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network (Q2271121) (← links)
- A dynamic over-sampling procedure based on sensitivity for multi-class problems (Q2275973) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- Local search-based hybrid algorithms for finding Golomb rulers (Q2385176) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- Scatter search with path relinking for phylogenetic inference (Q2570151) (← links)
- Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems (Q2638029) (← links)
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design (Q2655961) (← links)
- Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520) (← links)
- A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM (Q3585099) (← links)