Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
From MaRDI portal
Recommendations
- Advances in bio-inspired computing for combinatorial optimization problems
- Evolutionary optimization algorithms. Biologically inspired and population-based approaches to computer intelligence
- Nature-inspired computing and optimization. Theory and applications
- Biologically inspired optimization methods: An introduction.
- Handbook of Bioinspired Algorithms and Applications
Cited in
(84)- Improved time complexity analysis of the simple genetic algorithm
- Analysis of noisy evolutionary optimization when sampling fails
- Analysis of speedups in parallel evolutionary algorithms and (1 + ) EAs for combinatorial optimization
- On combinatorial optimization motivated by biology
- Solving problems with unknown solution length at almost no extra cost
- Sorting by swaps with noisy comparisons
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- Optimal mutation rates for the (1+) EA on OneMax through asymptotically tight drift analysis
- Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
- Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- Runtime analysis of evolutionary algorithms via symmetry arguments
- On the approximation ability of evolutionary optimization with application to minimum set cover
- Running time analysis of the (1+1)-EA for robust linear optimization
- The cost of randomness in evolutionary algorithms: crossover can save random bits
- Solving nonlinear systems and unconstrained optimization problems by hybridizing whale optimization algorithm and flower pollination algorithm
- The interplay of population size and mutation probability in the (1+ ) EA on OneMax
- Towards a runtime comparison of natural and artificial evolution
- Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints
- The use of tail inequalities on the probable computational time of randomized search heuristics
- A quantum computing based numerical method for solving mixed-integer optimal control problems
- A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm
- Time complexity analysis of evolutionary algorithms on random satisfiable k-CNF formulas
- Biologically-inspired optimisation methods. Parallel algorithms, systems and applications
- The Max problem revisited: the importance of mutation in genetic programming
- Hybridizations of evolutionary algorithms with large neighborhood search
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- Runtime analysis for self-adaptive mutation rates
- Static and self-adjusting mutation strengths for multi-valued decision variables
- Exponential upper bounds for the runtime of randomized search heuristics
- MMAS versus population-based EA on a family of dynamic fitness functions
- 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
- Does comma selection help to cope with local optima?
- Fast mutation in crossover-based algorithms
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee
- Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change
- The runtime of the compact genetic algorithm on jump functions
- Black-box search by unbiased variation
- Choosing the right algorithm with hints from complexity theory
- Putting continuous metaheuristics to work in binary search spaces
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- The unbiased black-box complexity of partition is polynomial
- 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
- Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem
- Design and analysis of different alternating variable searches for search-based software testing
- Extremal optimization: fundamentals, algorithms, and applications
- A runtime analysis of parallel evolutionary algorithms in dynamic optimization
- 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 quality diversity algorithms
- Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
- Cover-encodings of fitness landscapes
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- Runtime analysis of ant colony optimization on dynamic shortest path problems
- Self-adjusting evolutionary algorithms for multimodal optimization
- Biologically inspired optimization methods: An introduction.
- Concentrated hitting times of randomized search heuristics with variable drift
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- An analysis on recombination in multi-objective evolutionary optimization
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
- Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences
- An order-based algorithm for minimum dominating set with application in graph mining
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems
- Biobjective optimization problems on matroids with binary costs
- On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- Bioinspired heuristics for optimization. Selected papers of the 6th international conference on metaheuristics and nature inspired computing, Marrakech, Morocco, October 27-- 31, 2016
- Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
- Evolutionary algorithms and dynamic programming
- On the runtime analysis of the simple genetic algorithm
- Do additional target points speed up evolutionary algorithms?
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- Trees social relations optimization algorithm: a new swarm-based metaheuristic technique to solve continuous and discrete optimization problems
- Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem
- First Steps Towards a Runtime Analysis of Neuroevolution
- Algorithms and complexity in biological pattern formation problems
- A comparative performance analysis of evolutionary algorithms on k-median and facility location problems
- On the convergence of biogeography-based optimization for binary problems
This page was built for publication: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606874)
