Pages that link to "Item:Q1104056"

The following pages link to Evolution algorithms in combinatorial optimization (Q1104056):

Displaying 49 items.

• Common intervals of multiple permutations (Q534763) (← links)
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527) (← links)
• Sequencing and scheduling for filling lines in dairy production (Q691446) (← links)
• USPEX-evolutionary crystal structure prediction (Q709941) (← links)
• Common intervals of trees (Q834996) (← links)
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing (Q919753) (← links)
• The ``molecular'' traveling salesman (Q922393) (← links)
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
• A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
• Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
• Local search in coding theory (Q1199575) (← links)
• Performance of a neural network method with set partitioning (Q1199894) (← links)
• Neural network methods in combinatorial optimization (Q1200816) (← links)
• Genetic algorithms and traveling salesman problems (Q1268132) (← links)
• The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
• Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
• Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem (Q1282966) (← links)
• Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012) (← links)
• Genetic local search in combinatorial optimization (Q1317048) (← links)
• Genetically improved presequences for Euclidean traveling salesman problems (Q1341408) (← links)
• A new adaptive multi-start technique for combinatorial global optimizations (Q1342281) (← links)
• Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
• Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
• Resolution of pattern recognition problems using a hybrid genetic/random neural network learning algorithm (Q1392501) (← links)
• Chemical compound design using nuclear charge distributions (Q1617573) (← links)
• A computer-aided process planning model based on genetic algorithms (Q1906941) (← links)
• Scatter search and star-paths: Beyond the genetic metaphor (Q1908997) (← links)
• A genetic algorithm approach to periodic railway synchronization (Q1915964) (← links)
• Combining simulated annealing with local search heuristics (Q1919834) (← links)
• Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
• Genetic and hybrid algorithms for graph coloring (Q1919854) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Parallel local search (Q1922627) (← links)
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs (Q1999003) (← links)
• Optimal minimal variation control with quality constraint for fed-batch fermentation processes involving multiple feeds (Q2200149) (← links)
• Modeling and parameter identification for a nonlinear multi-stage system for \textit{dha regulon} in batch culture (Q2285994) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A hybrid genetic algorithm for the resource-constrained project scheduling problem (Q2455614) (← links)
• Memetic particle swarm optimization (Q2468766) (← links)
• Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
• Searching the solution space in constructive geometric constraint solving with genetic algorithms (Q2574087) (← links)
• (Q4267097) (← links)
• Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry (Q4540876) (← links)
• The Parallel Genetic Algorithm for Electromagnetic Inverse Scattering of a Conductor (Q4543520) (← links)
• CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION (Q4820065) (← links)
• Binary Optimal Control of Single-Flux-Quantum Pulse Sequences (Q5047936) (← links)
• Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)