Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431298
DOI10.1007/b11836zbMath1124.68434OpenAlexW2495578842MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization, Evolutionary algorithms and matroid optimization problems, Running time analysis of ant colony optimization for shortest path problems, Oblivious Randomized Direct Search for Real-Parameter Optimization