๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple algorithm for the solution of the multiple dosing problem

โœ Scribed by Selim S. Hacisalihzade

Book ID
113290787
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
414 KB
Volume
20
Category
Article
ISSN
0169-2607

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simple approximation algorithm for the
A simple approximation algorithm for the weighted matching problem
โœ Doratha E Drake; Stefan Hougardy ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [

A simple dual algorithm for the generali
A simple dual algorithm for the generalised assignment problem
โœ John M. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Springer US ๐ŸŒ English โš– 415 KB

A new algorithm for the generalised assignment problem is described in this paper. The dual-type algorithm uses a simple heuristic derived from a relaxation of the problem. The algorithm has been tested on generalised assignment problems of substantial size and compared to an exact integer programmi

A Simple Algorithm for the Planar Multiw
A Simple Algorithm for the Planar Multiway Cut Problem
โœ Wei-Chang Yeh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted planar graph with k specified vertices into k components such that the tota