✦ LIBER ✦

The tree center problems and the relationship with the bottleneck knapsack problems

✍ Scribed by Shioura, Akiyoshi; Shigeno, Maiko

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 57 KB
Volume: 29
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199703)29:2<107::aid-net4>3.0.co;2-n

No coin nor oath required. For personal study only.

✦ Synopsis

The tree center problems are designed to find a subtree minimizing the maximum distance from any vertex. This paper shows that these problems in a tree network are related to the bottleneck knapsack problems and presents linear-time algorithms for the tree center problems by using the relation.

📜 SIMILAR VOLUMES

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

On the solution of a stochastic bottlene

On the solution of a stochastic bottleneck assignment problem and its variations

✍ Prabuddha De; Jay B. Ghosh; Charles E. Wells 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB 👁 2 views

The decision tree polytope and its appli

The decision tree polytope and its application to sequential decision problems

✍ Art Warburton 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

This paper describes a new mathematical programming approach to sequential decision problems that have an underlying decision tree structure. The approach, based upon a characterization of strategies as extreme points of a 0-1 polytope called the 'decision tree polytope', is particularly suited to t

A branch and cut method for the degree-c

A branch and cut method for the degree-constrained minimum spanning tree problem

✍ L. Caccetta; S.P. Hill 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

Allergy to antibacterials: the problem w

Allergy to antibacterials: the problem with beta-lactams and sulfonamides

✍ Andreas Cerny; Werner Pichler 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

This paper reviews the incidence, clinical manifestations, dierential diagnosis, risk factors and pathogenesis of allergic reactions of two important classes of antimicrobials: beta-lactams and sulfonamides. The diagnostic work-up of a patient with a history of an allergic reaction will be discussed

The parallel replacement problem with de

The parallel replacement problem with demand and capital budgeting constraints

✍ Joseph C. Hartman 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integ