An exact algorithm for the unbounded knapsack problem with minimizing maximum processing time.: An article from: Journal of Computer Science |  | Authors: Chanin Srisuwannapa, Peerayuth Charnsethikul
Publisher: Thomson Gale
Category: Book
Buy New: $9.95
Format: Html
Media: Digital
Pages: 14
Publication Date: March 1, 2007
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is an article from Journal of Computer Science, published by Thomson Gale on March 1, 2007. The length of the article is 3948 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.
From the author: Key words: Integer programming, bounded and unbounded knapsack problems
Citation Details
Title: An exact algorithm for the unbounded knapsack problem with minimizing maximum processing time.
Author: Chanin Srisuwannapa
Publication: Journal of Computer Science (Magazine/Journal)
Date: March 1, 2007
Publisher: Thomson Gale
Volume: 3 Issue: 3 Page: 138(6)
Distributed by Thomson Gale
|
|
|
