- http://experiment.worldcat.org/entity/work/data/137161805#Topic/searching
- http://experiment.worldcat.org/entity/work/data/137161805#Topic/flow_charting
- http://experiment.worldcat.org/entity/work/data/137161805#Topic/mathematical_programming
- http://experiment.worldcat.org/entity/work/data/137161805#Topic/algorithms
- http://id.loc.gov/authorities/subjects/sh85003487
- http://experiment.worldcat.org/entity/work/data/137161805#Topic/optimization
- http://experiment.worldcat.org/entity/work/data/137161805#Topic/theoretical_mathematics
- http://id.loc.gov/authorities/subjects/sh85016389
- http://id.worldcat.org/fast/805020
- http://id.worldcat.org/fast/837828
- http://experiment.worldcat.org/entity/work/data/137161805#Topic/algorithmus
- http://experiment.worldcat.org/entity/work/data/137161805#Topic/branch_and_bound_methode

- http://experiment.worldcat.org/entity/work/data/137161805#Person/toffoli_t
- http://id.loc.gov/authorities/names/n83166909
- http://experiment.worldcat.org/entity/work/data/137161805#Organization/massachusetts_inst_of_tech_cambridge_lab_for_computer_science
- http://viaf.org/viaf/162298289
- http://viaf.org/viaf/104357341

- "The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the LLDP. In fact this procedure requires a number of storage variables which is independent of problem size and very small; moreover, the procedure is self-contained in the sense that it can be externally attached to any LIFO branch-and-bound program without interfering with its algorithms and data structures. (Author)."@en

- "An Efficient Algorithm for Determining the Length of the Longest Dead Path in an 'Lifo' Branch-and-Bound Exploration Schema"@en
- "An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema"@en
- "An efficient algorithm for determining the length of the longest dead path in a "LIFO" branch-and-bound exploration schema"@en
- "An efficient algorithm for determining the length of the longest dead path in an lifo branch-and-bound exploration schema"