An Efficient Algorithm for Determining the Length of the Longest Dead Path in a LIFO Branch-and-Bound Exploration Schema - researchr publication references

researchr

You are not signed in
Sign in
Sign up

Stefano Pallottino, Tommaso Toffoli. An Efficient Algorithm for Determining the Length of the Longest Dead Path in a LIFO Branch-and-Bound Exploration Schema. ACM Transactions on Mathematical Software, 7(4):498-504, 1981. [doi]

No references recorded for this publication.

No citations of this publication recorded.

runs on WebDSL