WorldCat Linked Data Explorer

http://worldcat.org/entity/work/id/137161805

An Efficient Algorithm for Determining the Length of the Longest Dead Path in an 'Lifo' Branch-and-Bound Exploration Schema

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).

Open All Close All

http://schema.org/description

  • "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

http://schema.org/name

  • "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"