Logic versus Approximation

DOI10.1007/B98383zbMATH Open1099.68743OpenAlexW2504298671MaRDI QIDQ5712366FDOQ5712366

Ingo Wegener

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98383

Recommendations

• Mathematical Foundations of Computer Science 2003
• Upper and lower bounds for randomized search heuristics in black-box optimization
• scientific article; zbMATH DE number 2065676
• Randomized algorithms in combinatorial optimization: A survey
• scientific article; zbMATH DE number 1754585

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20)

Cited In (13)

• Enhancing stochastic search performance by value-biased randomization of heuristics
• Mathematical Foundations of Computer Science 2003
• STACS 2005
• Randomized algorithms in combinatorial optimization: A survey
• Oblivious Randomized Direct Search for Real-Parameter Optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Alternative sampling strategy for a random optimization algorithm
• Importance of search-domain reduction in random optimization
• Evolutionary algorithms and matroid optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Logic versus Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712366)