A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2005/01/01
-
Journal
-
Indian UGC (journal)
-
Refrences20
-
Citations4
-
Chandra Chekuri
-
Sanjeev Khanna
Cite
Chekuri, Chandra, and Sanjeev Khanna. “A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem”. SIAM Journal on Computing, vol. 35, no. 3, 2005, pp. 713-28, https://doi.org/10.1137/s0097539700382820.
Chekuri, C., & Khanna, S. (2005). A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. SIAM Journal on Computing, 35(3), 713-728. https://doi.org/10.1137/s0097539700382820
Chekuri, Chandra, and Sanjeev Khanna. “A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem”. SIAM Journal on Computing 35, no. 3 (2005): 713-28. https://doi.org/10.1137/s0097539700382820.
Chekuri C, Khanna S. A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. SIAM Journal on Computing. 2005;35(3):713-28.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Computers and intractability | 1979 | |||
| Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses | European Journal of Operational Research |
| 68 | 1984 |
| 10.1007/BFb0121195 | ||||
| 10.1137/S1052623493254455 | ||||
| 10.1007/BF02579456 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Approximation Algorithms for the MAXSPACE Advertisement Problem | Theory of Computing Systems |
| 2024 | |
A Two-Phase Pattern Generation and Production Planning Procedure for the Stochastic Skiving Process | Applied Computational Intelligence and Soft Computing |
| 2023 | |
| Core-Pricing in Large Multi-Object Auctions: A Market Design for Selling TV-Ads | SSRN Electronic Journal | 2013 | ||
| Dedicated Transportation Subnetworks: Design, Analysis, and Insights | SSRN Electronic Journal | 2012 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 2
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Dedicated Transportation Subnetworks: Design, Analysis, and Insights and was published in 2012. The most recent citation comes from a 2024 study titled Approximation Algorithms for the MAXSPACE Advertisement Problem. This article reached its peak citation in 2024, with 1 citations. It has been cited in 3 different journals, 33% of which are open access. Among related journals, the SSRN Electronic Journal cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.