Sign inSubmit
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 Charnsethikul
ArticleArticle metrics

Since publication

7,595Views
8,282PDF downloads
7Citations (Crossref)

Views and downloads by month

NovDecJanFebMarAprMayJunJulAugSepOct
Views PDF downloadsLast 12 months, counted as COUNTER asks (robots and repeat clicks within 30 seconds left out)
Show as a table
Views and downloads by month
MonthViewsDownloads
Nov 2025198157
Dec 2025144102
Jan 2026156135
Feb 2026127102
Mar 2026196117
Apr 2026126158
May 2026179150
Jun 2026169135
Jul 2026171146
Aug 202680129
Sep 2026139101
Oct 2026110120

Citing articles (7)

Read from Crossref’s cited-by service every week, newest first.

  1. doi:10.1007/s44196-025-00909-1Found 1 August 2025
  2. doi:10.1007/978-3-642-16321-0_11Found 12 June 2020
  3. doi:10.1016/j.tcs.2014.09.012Found 12 June 2020
  4. doi:10.1016/j.disopt.2008.09.004Found 12 June 2020
  5. doi:10.4018/ijats.2014100101Found 12 June 2020
  6. doi:10.1017/s1931436100001073Found 12 June 2020
  7. doi:10.1016/j.ejor.2011.06.010Found 12 June 2020