Desarkar S.C.

S.C. Desarkar

Information about the author S.C. Desarkar will soon be added to the site.
Found 4 papers in total
Multiple stack branch and bound
Multiple stack branch and bound
1991
A multiple stack branch and bound (MSBB) algorithm which uses a multiple stack data...
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack-problem
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack-problem
1992
The Non-Increasing First Fit (NIFF) greedy algorithm for the 0/1 knapsack problem does...
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
1991
It is known that a best-first search algorithm like A* requires too much space...
Effective use of memory in iterative deepening search
Effective use of memory in iterative deepening search
1992
The Iterative Deepening A* (IDA*) algorithm often reexpands too many nodes...
Papers per page: