𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Branch-and-Bound Strategies for the Log Bucking Problem

✍ Scribed by Paul M. Bobrowski

Book ID
109167216
Publisher
Decision Sciences Institute, Georgia State University
Year
1990
Tongue
English
Weight
567 KB
Volume
21
Category
Article
ISSN
0011-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Branch and bound methods for a search pr
Branch and bound methods for a search problem
✍ Alan R. Washburn πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

A branch and bound algorithm for the tra
A branch and bound algorithm for the traveling purchaser problem
✍ Kashi N. Singh; Dirk L. van Oudheusden πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm