On Balut's Algorithm and NP-Completeness for a...

Management Science 1983 / 03 Vol. 29; Iss. 3

On Balut's Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem

Hiroshi Kise and Toshihide Ibaraki
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
29
Language:
english
Journal:
Management Science
DOI:
10.2307/2631064
Date:
March, 1983
File:
PDF, 539 KB
english, 1983
Conversion to is in progress
Conversion to is failed