Showing 1 - 2 of 2

1

Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii
AHN, Junil ; KIM, Kiseon
IEEE communications letters. 16(6):805-808

Telecommunications Télécommunications Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Academic journal
Save to List
2

A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem: A mixture of dynamic programming and branch-and-bound for the subset-sum problem
Silvano Martello ; Paolo Toth
Management Science. 30:765-771

depth-first tree search... Subset-Sum Problem 0211 other engineering a... Integer programming integer algorithms, bran... knapsack problem
Academic journal
Save to List

Filter