𝔖 Bobbio Scriptorium
✦   LIBER   ✦

MIXED μ PROBLEMS AND BRANCH AND BOUND TECHNIQUES

✍ Scribed by Matthew P. Newlin; Peter M. Young

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
191 KB
Volume
7
Category
Article
ISSN
1049-8923

No coin nor oath required. For personal study only.

✦ Synopsis

The computation of the general structural singular value ( ) is NP hard, so quick solutions to medium sized problems must often be approximate. In many of the cases where the current approximate methods are unsatisfactory, improved solutions are highly desirable. It is shown that, despite their worst-case combinatorial nature, branch and bound techniques can give substantially improved solutions with only moderate computational cost.

📜 SIMILAR VOLUMES

Enhancing CLP branch and bound technique
Enhancing CLP branch and bound techniques for scheduling problems
✍ F. Bosi; M. Milano 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

In this paper, we propose a constraint logic programming (CLP) approach to the solution of a job shop scheduling problem in the field of production planning in orthopaedic hospital departments. A pure CLP on finite domain (CLP(FD)) approach to the problem has been developed, leading to disappointing

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

The critical-item, upper bounds, and a b
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
✍ Shaw, Dong X.; Cho, Geon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac