Limiting the search in brute force method for subsets detection

DOI10.1007/978-3-031-47859-8_24MaRDI QIDQ6588759zbMATH OpenFDO

Authors B. V. Kupriyanov, A. A. Roschin

Publication date 16 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47859-8_24

zbMATH Keywords

graphlimiting the number of combinations to iterate throughNP-complete problemsearch for subsets

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 559036
• Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
• Generating combinatorial sets with given properties
• scientific article; zbMATH DE number 3917730
• An algorithm for generating subsets of fixed size with a strong minimal change property

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Inclusion/Exclusion Meets Measure and Conquer

This page was built for publication: Limiting the search in brute force method for subsets detection

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