scientific article; zbMATH DE number 5686753
From MaRDI portal
Publication:5306039
zbMath1233.90005MaRDI QIDQ5306039
No author found.
Publication date: 26 March 2010
Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789814282673/toc.shtml
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (76)
Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning ⋮ Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax ⋮ A runtime analysis of parallel evolutionary algorithms in dynamic optimization ⋮ Towards a runtime comparison of natural and artificial evolution ⋮ Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Variable solution structure can be helpful in evolutionary optimization ⋮ Runtime analysis of non-elitist populations: from classical optimisation to partial information ⋮ Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems ⋮ MMAS versus population-based EA on a family of dynamic fitness functions ⋮ Tight bounds on the expected runtime of a standard steady state genetic algorithm ⋮ Does comma selection help to cope with local optima? ⋮ Self-adjusting evolutionary algorithms for multimodal optimization ⋮ Fast mutation in crossover-based algorithms ⋮ The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem ⋮ Analysis of noisy evolutionary optimization when sampling fails ⋮ Runtime analysis for self-adaptive mutation rates ⋮ On Approximating the Stationary Distribution of Time-reversible Markov Chains ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints ⋮ Design and analysis of different alternating variable searches for search-based software testing ⋮ Improved time complexity analysis of the simple genetic algorithm ⋮ Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) ⋮ Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences ⋮ On the approximation ability of evolutionary optimization with application to minimum set cover ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ Runtime analysis for permutation-based evolutionary algorithms ⋮ Multiplicative drift analysis ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations ⋮ Non-existence of linear universal drift functions ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ Unnamed Item ⋮ Evolutionary algorithms for quantum computers ⋮ On the convergence of biogeography-based optimization for binary problems ⋮ The unbiased black-box complexity of partition is polynomial ⋮ Evolutionary algorithms and dynamic programming ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Solving problems with unknown solution length at almost no extra cost ⋮ Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise ⋮ Sorting by swaps with noisy comparisons ⋮ Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints ⋮ Runtime analysis of evolutionary algorithms via symmetry arguments ⋮ Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change ⋮ Runtime analysis of ant colony optimization on dynamic shortest path problems ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint ⋮ On approximating the stationary distribution of time-reversible Markov chains ⋮ Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA ⋮ Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions ⋮ Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ On the runtime analysis of the simple genetic algorithm ⋮ Performance analysis of randomised search heuristics operating with a fixed budget ⋮ The Max problem revisited: the importance of mutation in genetic programming ⋮ Running time analysis of the (1+1)-EA for robust linear optimization ⋮ The Secret Life of Keys: On the Calculation of Mechanical Lock Systems ⋮ Unnamed Item ⋮ Convergence of set-based multi-objective optimization, indicators and deteriorative cycles ⋮ Unnamed Item ⋮ Two proofs for shallow packings ⋮ Statistical and computational tradeoff in genetic algorithm-based estimation ⋮ Balanced Allocation on Graphs: A Random Walk Approach ⋮ Memory-restricted black-box complexity of OneMax ⋮ Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms ⋮ Unnamed Item ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity ⋮ On the effectiveness of immune inspired mutation operators in some discrete optimization problems ⋮ Fitness levels with tail bounds for the analysis of randomized search heuristics
This page was built for publication:
