Order results by:
| Issue | Title | |
| Vol 16, No 3 (2016) | Application of genetic algorithm for the set-covering problem solution | Abstract similar documents |
| Igor S. Konovalov, Vladimir A. Fatkhi, Valery G. Kobak | ||
| "... Рассматриваются взвешенная и невзвешенная задачи нахождения минимального покрытия множеств, а также ..." | ||
| Vol 17, No 3 (2017) | Efficiency comparison of exact and approximate algorithms for solving set covering problem | Abstract similar documents |
| Igor S. Konovalov, Sergey S. Ostapenko, Valery G. Kobak | ||
| "... Введение. Множество практических задач опирается на задачу покрытия множеств: построение расписаний ..." | ||
| 1 - 2 of 2 Items | ||
Search tips:
- Search terms are case-insensitive
- Common words are ignored
- By default articles containing any term in the query are returned (i.e., OR is implied)
- Make sure that a word exists in an article by prefixing it with +; e.g., +journal +access scholarly academic
- Combine multiple words with AND to find articles containing all terms; e.g., education AND research
- Exclude a word by prefixing it with - or NOT; e.g., online -politics or online NOT politics
- Search for an exact phrase by putting it in quotes; e.g., "open access publishing". Hint: Quoting Chinese or Japanese words will help you to find exact word matches in mixed-language fields, e.g. "中国".
- Use parentheses to create more complex queries; e.g., archive ((journal AND conference) NOT theses)
