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).
"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
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE.
This is a placeholder reference for a Organization entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.