𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for two generalized 2-median problems and the group median problem on trees

✍ Scribed by Chi-Yuan Chan; Shan-Chyun Ku; Chi-Jen Lu; Biing-Feng Wang

Book ID
108281504
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
1004 KB
Volume
410
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because

An efficient branch-and-bound algorithm
An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem : Wei-Chang Yeh, v20, n2, 2001, pp113–123
πŸ“‚ Article πŸ“… 2002 πŸ› Society of Manufacturing Engineers 🌐 English βš– 296 KB

and keyword index optimization, the infrastructure is capable of finding robust error recovery algorithms. It is expected that this approach will require less time for the generation of robust error recovery logic.