Review of Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics by Juraj Hromkovič. Springer 2001
Reviewer: 
Hassan MasumAuthors Info & Claims
- Review of Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics by Juraj Hromkovič. Springer 2001
Recommendations
Emergentist classifiers, genetic algorithmics and LATAO: study and preliminairy results of an ongoing France-Quebec cooperation
RIAO '97: Computer-Assisted Information Searching on Internet - Volume 2Cet article présente un bilan de recherche et développement effectués dans le cadre du projet Franco-Québécois intitulé "Les classifieurs émergentistes et le traitement de T information", sous la co-tutelle du Ministère de l'Enseignement Supérieur et de ...
Hard multidimensional multiple choice knapsack problems, an empirical study
Recent advances in algorithms for the multidimensional multiple choice knapsack problems have enabled us to solve rather large problem instances. However, these algorithms are evaluated with very limited benchmark instances. In this study, we propose ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2003 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 2003
Published in SIGACT Volume 34, Issue 2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 225Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in