I am writing a branch and bound algorithm for
a worker-job assignment (100 jobs, 8 workers) problem. Every parent
node give rise to multiple children nodes. These children nodes have
one extra job assignment than the parent node. Therefore, I first
copy assignments (and other related data) of the parent node in the
children node. (Ex: parent node: a(node, 1)=2, a(node, 2)=3, a
(node,3)=8,--, a(node,50)=4 and other related details)

Then I make 1 additional job assignment in the children nodes (node
+j, j=1 to births).
(a(node+j, 1)=2, a(node+j, 2)=3, a(node+j,3)=8, a(node+j,50)=4,
a(node+j, 54)=5)
Many of these children nodes are maintained for quite some time.