
ISSN 1549-3636 (print)eISSN 1552-6607 (online) Open access
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
Research Article · Open access · Published 31 March 2007
An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time
Chanin Srisuwannapa, Peerayuth CharnsethikulSince publication
7,595Views
8,282PDF downloads
7Citations (Crossref)
Views and downloads by month
Show as a table
| Month | Views | Downloads |
|---|---|---|
| Nov 2025 | 198 | 157 |
| Dec 2025 | 144 | 102 |
| Jan 2026 | 156 | 135 |
| Feb 2026 | 127 | 102 |
| Mar 2026 | 196 | 117 |
| Apr 2026 | 126 | 158 |
| May 2026 | 179 | 150 |
| Jun 2026 | 169 | 135 |
| Jul 2026 | 171 | 146 |
| Aug 2026 | 80 | 129 |
| Sep 2026 | 139 | 101 |
| Oct 2026 | 110 | 120 |
Citing articles (7)
Read from Crossref’s cited-by service every week, newest first.
- doi:10.1007/s44196-025-00909-1Found 1 August 2025
- doi:10.1007/978-3-642-16321-0_11Found 12 June 2020
- doi:10.1016/j.tcs.2014.09.012Found 12 June 2020
- doi:10.1016/j.disopt.2008.09.004Found 12 June 2020
- doi:10.4018/ijats.2014100101Found 12 June 2020
- doi:10.1017/s1931436100001073Found 12 June 2020
- doi:10.1016/j.ejor.2011.06.010Found 12 June 2020