𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strongly polynomial time algorithms for certain concave minimization problems on networks

✍ Scribed by Hoang Tuy; Nguyen Dinh Dan; Saied Ghannadan

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
564 KB
Volume
14
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Polynomial time algorithms for minimizin
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
✍ Philippe Baptiste πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 102 KB πŸ‘ 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t