Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431298
DOI10.1007/b11836zbMath1124.68434MaRDI QIDQ5431298
Publication date: 7 December 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11836
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
90C59: Approximation methods and heuristics in mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W20: Randomized algorithms
Related Items
Running time analysis of ant colony optimization for shortest path problems, Evolutionary algorithms and matroid optimization problems, Algorithmic analysis of a basic evolutionary algorithm for continuous optimization, Oblivious Randomized Direct Search for Real-Parameter Optimization