Search | Science Publications

Research ArticleOpen accessAll words, across the recordAn Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing TimeChanin Srisuwannapa, Peerayuth CharnsethikulWe address a variant of the unbounded knapsack problem (UKP) into which the processing time of each item is also put and considered, referred as MMPTUKP. The MMPTUKP is a decision problem of allocating amount of n items, such that the maximum processing time of the selected items is minimized and the total profit is gained as at least as … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,595 accessesView PDF Cite

101 articles for “decision problems”