- A complete anytime algorithm for number partitioning
1998/12/01 by Richard E. Korf · 231 citations
Computer Science · Decision Sciences · Mathematics · #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Constraint Satisfaction and Optimization #Heuristic #Knapsack problem #Mathematical optimization #Mathematics #Running time #Scheduling and Timetabling Solutions #Set (abstract data type) #Subset sum problem #Time complexity
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
1980/08/01 by Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan · 279 citations
Computer Science · Engineering · Mathematics · #Algorithm #Algorithms and Data Compression #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #Enumeration #Independence (probability theory) #Knapsack problem #Mathematics #Optimization and Packing Problems #Polynomial #Subroutine #Subset sum problem #Time complexity