原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
u have one computer and a set of n tasks {a1, a2, … , an} requiring time on the computer.
Each task aj requires tj time units on the computer (its processing time), yields a profit of pj, and has a deadline dj. The computer can process only one task at a time, and task aj must run without interruption for tj consecutive time units. If task aj completes by its deadline dj, you receive a profit pj. If instead task aj completes after
its deadline, you receive no profit. As an optimization problem, given the processing tim
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea