Pages that link to "Item:Q606874"

The following pages link to Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity (Q606874):

Displaying 50 items.

• Runtime analysis of non-elitist populations: from classical optimisation to partial information (Q306486) (← links)
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems (Q306491) (← links)
• MMAS versus population-based EA on a family of dynamic fitness functions (Q306495) (← links)
• Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization (Q403016) (← links)
• On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
• The use of tail inequalities on the probable computational time of randomized search heuristics (Q428911) (← links)
• The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances (Q477078) (← links)
• Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change (Q477083) (← links)
• Runtime analysis of ant colony optimization on dynamic shortest path problems (Q477086) (← links)
• An analysis on recombination in multi-objective evolutionary optimization (Q490439) (← links)
• Advances in bio-inspired computing for combinatorial optimization problems (Q494689) (← links)
• Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
• Evolutionary algorithms and dynamic programming (Q652137) (← links)
• Convergence of set-based multi-objective optimization, indicators and deteriorative cycles (Q714857) (← links)
• On the effectiveness of immune inspired mutation operators in some discrete optimization problems (Q781286) (← links)
• An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
• Design and analysis of different alternating variable searches for search-based software testing (Q888422) (← links)
• Improved time complexity analysis of the simple genetic algorithm (Q888423) (← links)
• Biologically-inspired optimisation methods. Parallel algorithms, systems and applications (Q1019055) (← links)
• A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems (Q1626279) (← links)
• On the convergence of biogeography-based optimization for binary problems (Q1717756) (← links)
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate (Q1725645) (← links)
• Solving problems with unknown solution length at almost no extra cost (Q1725649) (← links)
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise (Q1725652) (← links)
• Sorting by swaps with noisy comparisons (Q1725654) (← links)
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints (Q1725656) (← links)
• Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis (Q1750363) (← links)
• Static and self-adjusting mutation strengths for multi-valued decision variables (Q1750364) (← links)
• Cover-encodings of fitness landscapes (Q1786928) (← links)
• Black-box search by unbiased variation (Q1945171) (← links)
• Fixed-parameter evolutionary algorithms and the vertex cover problem (Q1949737) (← links)
• Running time analysis of the (1+1)-EA for robust linear optimization (Q2003994) (← links)
• Putting continuous metaheuristics to work in binary search spaces (Q2012877) (← links)
• Trees social relations optimization algorithm: a new swarm-based metaheuristic technique to solve continuous and discrete optimization problems (Q2076801) (← links)
• A quantum computing based numerical method for solving mixed-integer optimal control problems (Q2121181) (← links)
• Tight bounds on the expected runtime of a standard steady state genetic algorithm (Q2144273) (← links)
• Does comma selection help to cope with local optima? (Q2144274) (← links)
• Self-adjusting evolutionary algorithms for multimodal optimization (Q2144276) (← links)
• Fast mutation in crossover-based algorithms (Q2144278) (← links)
• A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm (Q2150758) (← links)
• An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
• Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints (Q2182714) (← links)
• Exponential upper bounds for the runtime of randomized search heuristics (Q2220808) (← links)
• Runtime analysis of evolutionary algorithms via symmetry arguments (Q2224858) (← links)
• The runtime of the compact genetic algorithm on jump functions (Q2240129) (← links)
• A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (Q2248551) (← links)
• On the runtime analysis of the simple genetic algorithm (Q2250994) (← links)
• The Max problem revisited: the importance of mutation in genetic programming (Q2250999) (← links)
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem (Q2321315) (← links)