Knapsack problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Knapsack problem" in English language version.

Last modified: 08:12:41, 21 June 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

3027doi.org

2^nd place

108worldcat.org

4^th place

76psu.edu

299^th place

159^th place

75semanticscholar.org

15^th place

8^th place

55arxiv.org

49^th place

31^st place

44books.google.com

3^rd place

31columbia.edu

554^th place

368^th place

22jstor.org

23^rd place

15^th place

22adsabs.harvard.edu

14^th place

9^th place

11oxfordjournals.org

1,550^th place

3,406^th place

11web.archive.org

1^st place

11hdl.handle.net

66^th place

34^th place

11ams.org

434^th place

249^th place

11siam.org

9,070^th place

5,832^nd place

11nus.edu.sg

2,453^rd place

1,629^th place

11technion.ac.il

low place

11scholar.google.com

1,418^th place

768^th place

11sciencedirect.com

137^th place

146^th place

11springer.com

182^nd place

172^nd place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Lucas, Andrew (2014). "Ising formulations of many NP problems". Frontiers in Physics. 2: 5. arXiv:1302.5843. Bibcode:2014FrP.....2....5L. doi:10.3389/fphy.2014.00005. ISSN 2296-424X.
Witzgall, C. (1975). "Mathematical methods of site selection for Electronic Message Systems (EMS)". NASA Sti/Recon Technical Report N. 76. NBS Internal report: 18321. Bibcode:1975STIN...7618321W.

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Horowitz, Ellis; Sahni, Sartaj (1974), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292, doi:10.1145/321812.321823, hdl:1813/5989, MR 0354006, S2CID 16866858

arxiv.org (Global: 49^th place; English: 31^st place)

Wojtczak, Dominik (2018). "On Strong NP-Completeness of Rational Problems". Computer Science – Theory and Applications. Lecture Notes in Computer Science. Vol. 10846. pp. 308–320. arXiv:1802.09465. doi:10.1007/978-3-319-90530-3_26. ISBN 978-3-319-90529-7. S2CID 3637366.
Nederlof, Jesper; Węgrzycki, Karol (12 April 2021). "Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors". arXiv:2010.08576 [cs.DS].
Lucas, Andrew (2014). "Ising formulations of many NP problems". Frontiers in Physics. 2: 5. arXiv:1302.5843. Bibcode:2014FrP.....2....5L. doi:10.3389/fphy.2014.00005. ISSN 2296-424X.
Galvez, Waldo; Grandoni, Fabrizio; Ingala, Salvatore; Heydrich, Sandy; Khan, Arindam; Wiese, Andreas (2021). "Approximating Geometric Knapsack via L-packings". ACM Trans. Algorithms. 17 (4): 33:1–33:67. arXiv:1711.07710. doi:10.1145/3473713.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa; Yokomaku, Haruki (22 September 2019), Online Knapsack Problems with a Resource Buffer, arXiv:1909.10016

books.google.com (Global: 3^rd place; English: 3^rd place)

Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack problems. Berlin: Springer. p. 449. ISBN 978-3-540-40286-2. Retrieved 5 May 2022.
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack problems. Berlin: Springer. p. 461. ISBN 978-3-540-40286-2. Retrieved 5 May 2022.
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack problems. Berlin: Springer. p. 465. ISBN 978-3-540-40286-2. Retrieved 5 May 2022.
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack problems. Berlin: Springer. p. 472. ISBN 978-3-540-40286-2. Retrieved 5 May 2022.

columbia.edu (Global: 554^th place; English: 368^th place)

wimnet.ee.columbia.edu

Cohen, R. and Grebla, G. 2014. "Multi-Dimensional OFDMA Scheduling in a Wireless Network with Relay Nodes". in Proc. IEEE INFOCOM'14, 2427–2435.

doi.org (Global: 2^nd place; English: 2^nd place)

doi.org

Mathews, G. B. (25 June 1897). "On the partition of numbers" (PDF). Proceedings of the London Mathematical Society. 28: 486–490. doi:10.1112/plms/s1-28.1.486.
Feuerman, Martin; Weiss, Harvey (April 1973). "A Mathematical Programming Model for Test Construction and Scoring". Management Science. 19 (8): 961–966. doi:10.1287/mnsc.19.8.961. JSTOR 2629127.
Skiena, S. S. (September 1999). "Who is Interested in Algorithms and Why? Lessons from the Stony Brook Algorithm Repository". ACM SIGACT News. 30 (3): 65–74. CiteSeerX 10.1.1.41.8357. doi:10.1145/333623.333627. ISSN 0163-5700. S2CID 15619060. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Caccetta, L.; Kulanoot, A. (2001). "Computational Aspects of Hard Knapsack Problems". Nonlinear Analysis. 47 (8): 5547–5558. doi:10.1016/s0362-546x(01)00658-7.
Poirriez, Vincent; Yanev, Nicola; Andonov, Rumen (2009). "A hybrid algorithm for the unbounded knapsack problem". Discrete Optimization. 6 (1): 110–124. doi:10.1016/j.disopt.2008.09.004. ISSN 1572-5286. S2CID 8820628.
Wojtczak, Dominik (2018). "On Strong NP-Completeness of Rational Problems". Computer Science – Theory and Applications. Lecture Notes in Computer Science. Vol. 10846. pp. 308–320. arXiv:1802.09465. doi:10.1007/978-3-319-90530-3_26. ISBN 978-3-319-90529-7. S2CID 3637366.
Dobkin, David; Lipton, Richard J. (1978). "A lower bound of ½n² on linear search programs for the Knapsack problem". Journal of Computer and System Sciences. 16 (3): 413–417. doi:10.1016/0022-0000(78)90026-0.
Michael Steele, J; Yao, Andrew C (1 March 1982). "Lower bounds for algebraic decision trees". Journal of Algorithms. 3 (1): 1–8. doi:10.1016/0196-6774(82)90002-5. ISSN 0196-6774.
Ben-Amram, Amir M.; Galil, Zvi (2001), "Topological Lower Bounds on Algebraic Random Access Machines", SIAM Journal on Computing, 31 (3): 722–761, doi:10.1137/S0097539797329397.
auf der Heide, Meyer (1984), "A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem", Journal of the ACM, 31 (3): 668–676, doi:10.1145/828.322450
Andonov, Rumen; Poirriez, Vincent; Rajopadhye, Sanjay (2000). "Unbounded Knapsack Problem : dynamic programming revisited". European Journal of Operational Research. 123 (2): 168–181. CiteSeerX 10.1.1.41.2135. doi:10.1016/S0377-2217(99)00265-9. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Martello, S.; Toth, P. (1984). "A mixture of dynamic programming and branch-and-bound for the subset-sum problem". Manag. Sci. 30 (6): 765–771. doi:10.1287/mnsc.30.6.765.
Horowitz, Ellis; Sahni, Sartaj (1974), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292, doi:10.1145/321812.321823, hdl:1813/5989, MR 0354006, S2CID 16866858
Schroeppel, Richard; Shamir, Adi (August 1981). "A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems". SIAM Journal on Computing. 10 (3): 456–464. doi:10.1137/0210033. ISSN 0097-5397.
Dantzig, George B. (1957). "Discrete-Variable Extremum Problems". Operations Research. 5 (2): 266–288. doi:10.1287/opre.5.2.266.
Calvin, James M.; Leung, Joseph Y. -T. (1 May 2003). "Average-case analysis of a greedy algorithm for the 0/1 knapsack problem". Operations Research Letters. 31 (3): 202–210. doi:10.1016/S0167-6377(02)00222-5.
Lucas, Andrew (2014). "Ising formulations of many NP problems". Frontiers in Physics. 2: 5. arXiv:1302.5843. Bibcode:2014FrP.....2....5L. doi:10.3389/fphy.2014.00005. ISSN 2296-424X.
Kulik, A.; Shachnai, H. (2010). "There is no EPTAS for two dimensional knapsack" (PDF). Inf. Process. Lett. 110 (16): 707–712. CiteSeerX 10.1.1.161.5838. doi:10.1016/j.ipl.2010.05.031. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Chandra Chekuri and Sanjeev Khanna (2005). "A PTAS for the multiple knapsack problem". SIAM Journal on Computing. 35 (3): 713–728. CiteSeerX 10.1.1.226.3387. doi:10.1137/s0097539700382820. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Wu, Z. Y.; Yang, Y. J.; Bai, F. S.; Mammadov, M. (2011). "Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems". J Optim Theory Appl. 151 (2): 241–259. doi:10.1007/s10957-011-9885-4. S2CID 31208118.
Gallo, G.; Hammer, P. L.; Simeone, B. (1980). "Quadratic knapsack problems". Combinatorial Optimization. Mathematical Programming Studies. Vol. 12. pp. 132–149. doi:10.1007/BFb0120892. ISBN 978-3-642-00801-6.
Galvez, Waldo; Grandoni, Fabrizio; Ingala, Salvatore; Heydrich, Sandy; Khan, Arindam; Wiese, Andreas (2021). "Approximating Geometric Knapsack via L-packings". ACM Trans. Algorithms. 17 (4): 33:1–33:67. arXiv:1711.07710. doi:10.1145/3473713.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (11 January 2015). "Randomized algorithms for online knapsack problems". Theoretical Computer Science. 562: 395–405. doi:10.1016/j.tcs.2014.10.017. ISSN 0304-3975.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (1 September 2014). "Online Unweighted Knapsack Problem with Removal Cost". Algorithmica. 70 (1): 76–91. doi:10.1007/s00453-013-9822-z. ISSN 1432-0541.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa; Guo, He (26 June 2014). "Online removable knapsack problem under convex function". Theoretical Computer Science. Combinatorial Optimization: Theory of algorithms and Complexity. 540–541: 62–69. doi:10.1016/j.tcs.2013.09.013. ISSN 0304-3975.

dx.doi.org

Dobkin, David; Lipton, Richard J. (1978). "A lower bound of ½n² on linear search programs for the Knapsack problem". Journal of Computer and System Sciences. 16 (3): 413–417. doi:10.1016/0022-0000(78)90026-0.
Michael Steele, J; Yao, Andrew C (1 March 1982). "Lower bounds for algebraic decision trees". Journal of Algorithms. 3 (1): 1–8. doi:10.1016/0196-6774(82)90002-5. ISSN 0196-6774.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Horowitz, Ellis; Sahni, Sartaj (1974), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292, doi:10.1145/321812.321823, hdl:1813/5989, MR 0354006, S2CID 16866858

jstor.org (Global: 23^rd place; English: 15^th place)

Feuerman, Martin; Weiss, Harvey (April 1973). "A Mathematical Programming Model for Test Construction and Scoring". Management Science. 19 (8): 961–966. doi:10.1287/mnsc.19.8.961. JSTOR 2629127.
S. Martello, D. Pisinger, P. Toth, Dynamic programming and strong bounds for the 0-1 knapsack problem, Manag. Sci., 45:414–424, 1999.

nus.edu.sg (Global: 2,453^rd place; English: 1,629^th place)

scholarbank.nus.edu.sg

Chang, C. S., et al. "Genetic Algorithm Based Bicriterion Optimization for Traction Substations in DC Railway System." In Fogel [102], 11-16.

oxfordjournals.org (Global: 1,550^th place; English: 3,406^th place)

plms.oxfordjournals.org

Mathews, G. B. (25 June 1897). "On the partition of numbers" (PDF). Proceedings of the London Mathematical Society. 28: 486–490. doi:10.1112/plms/s1-28.1.486.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Skiena, S. S. (September 1999). "Who is Interested in Algorithms and Why? Lessons from the Stony Brook Algorithm Repository". ACM SIGACT News. 30 (3): 65–74. CiteSeerX 10.1.1.41.8357. doi:10.1145/333623.333627. ISSN 0163-5700. S2CID 15619060. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Pisinger, D. 2003. Where are the hard knapsack problems? Technical Report 2003/08, Department of Computer Science, University of Copenhagen, Copenhagen, Denmark.
Andonov, Rumen; Poirriez, Vincent; Rajopadhye, Sanjay (2000). "Unbounded Knapsack Problem : dynamic programming revisited". European Journal of Operational Research. 123 (2): 168–181. CiteSeerX 10.1.1.41.2135. doi:10.1016/S0377-2217(99)00265-9. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Chang, T. J., et al. Heuristics for Cardinality Constrained Portfolio Optimization. Technical Report, London SW7 2AZ, England: The Management School, Imperial College, May 1998
Kulik, A.; Shachnai, H. (2010). "There is no EPTAS for two dimensional knapsack" (PDF). Inf. Process. Lett. 110 (16): 707–712. CiteSeerX 10.1.1.161.5838. doi:10.1016/j.ipl.2010.05.031. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Chandra Chekuri and Sanjeev Khanna (2005). "A PTAS for the multiple knapsack problem". SIAM Journal on Computing. 35 (3): 713–728. CiteSeerX 10.1.1.226.3387. doi:10.1137/s0097539700382820. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

scholar.google.com (Global: 1,418^th place; English: 768^th place)

Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benkő : 2D knapsack: Packing squares, Theoretical Computer Science Vol. 508, pp. 35–40.

sciencedirect.com (Global: 137^th place; English: 146^th place)

Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (11 January 2015). "Randomized algorithms for online knapsack problems". Theoretical Computer Science. 562: 395–405. doi:10.1016/j.tcs.2014.10.017. ISSN 0304-3975.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Skiena, S. S. (September 1999). "Who is Interested in Algorithms and Why? Lessons from the Stony Brook Algorithm Repository". ACM SIGACT News. 30 (3): 65–74. CiteSeerX 10.1.1.41.8357. doi:10.1145/333623.333627. ISSN 0163-5700. S2CID 15619060. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Poirriez, Vincent; Yanev, Nicola; Andonov, Rumen (2009). "A hybrid algorithm for the unbounded knapsack problem". Discrete Optimization. 6 (1): 110–124. doi:10.1016/j.disopt.2008.09.004. ISSN 1572-5286. S2CID 8820628.
Wojtczak, Dominik (2018). "On Strong NP-Completeness of Rational Problems". Computer Science – Theory and Applications. Lecture Notes in Computer Science. Vol. 10846. pp. 308–320. arXiv:1802.09465. doi:10.1007/978-3-319-90530-3_26. ISBN 978-3-319-90529-7. S2CID 3637366.
Horowitz, Ellis; Sahni, Sartaj (1974), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21 (2): 277–292, doi:10.1145/321812.321823, hdl:1813/5989, MR 0354006, S2CID 16866858
Wu, Z. Y.; Yang, Y. J.; Bai, F. S.; Mammadov, M. (2011). "Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems". J Optim Theory Appl. 151 (2): 241–259. doi:10.1007/s10957-011-9885-4. S2CID 31208118.

siam.org (Global: 9,070^th place; English: 5,832^nd place)

epubs.siam.org

Schroeppel, Richard; Shamir, Adi (August 1981). "A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems". SIAM Journal on Computing. 10 (3): 456–464. doi:10.1137/0210033. ISSN 0097-5397.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (1 September 2014). "Online Unweighted Knapsack Problem with Removal Cost". Algorithmica. 70 (1): 76–91. doi:10.1007/s00453-013-9822-z. ISSN 1432-0541.

technion.ac.il (Global: low place; English: low place)

cs.technion.ac.il

Kulik, A.; Shachnai, H. (2010). "There is no EPTAS for two dimensional knapsack" (PDF). Inf. Process. Lett. 110 (16): 707–712. CiteSeerX 10.1.1.161.5838. doi:10.1016/j.ipl.2010.05.031. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

web.archive.org (Global: 1^st place; English: 1^st place)

Richard M. Karp (1972). "Reducibility Among Combinatorial Problems". In R. E. Miller and J. W. Thatcher (editors). Complexity of Computer Computations. New York: Plenum. pp. 85–103

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Skiena, S. S. (September 1999). "Who is Interested in Algorithms and Why? Lessons from the Stony Brook Algorithm Repository". ACM SIGACT News. 30 (3): 65–74. CiteSeerX 10.1.1.41.8357. doi:10.1145/333623.333627. ISSN 0163-5700. S2CID 15619060. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Poirriez, Vincent; Yanev, Nicola; Andonov, Rumen (2009). "A hybrid algorithm for the unbounded knapsack problem". Discrete Optimization. 6 (1): 110–124. doi:10.1016/j.disopt.2008.09.004. ISSN 1572-5286. S2CID 8820628.
Michael Steele, J; Yao, Andrew C (1 March 1982). "Lower bounds for algebraic decision trees". Journal of Algorithms. 3 (1): 1–8. doi:10.1016/0196-6774(82)90002-5. ISSN 0196-6774.
Schroeppel, Richard; Shamir, Adi (August 1981). "A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems". SIAM Journal on Computing. 10 (3): 456–464. doi:10.1137/0210033. ISSN 0097-5397.
Lucas, Andrew (2014). "Ising formulations of many NP problems". Frontiers in Physics. 2: 5. arXiv:1302.5843. Bibcode:2014FrP.....2....5L. doi:10.3389/fphy.2014.00005. ISSN 2296-424X.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (11 January 2015). "Randomized algorithms for online knapsack problems". Theoretical Computer Science. 562: 395–405. doi:10.1016/j.tcs.2014.10.017. ISSN 0304-3975.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (1 September 2014). "Online Unweighted Knapsack Problem with Removal Cost". Algorithmica. 70 (1): 76–91. doi:10.1007/s00453-013-9822-z. ISSN 1432-0541.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa; Guo, He (26 June 2014). "Online removable knapsack problem under convex function". Theoretical Computer Science. Combinatorial Optimization: Theory of algorithms and Complexity. 540–541: 62–69. doi:10.1016/j.tcs.2013.09.013. ISSN 0304-3975.

Knapsack problem (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

arxiv.org (Global: 49th place; English: 31st place)

books.google.com (Global: 3rd place; English: 3rd place)

columbia.edu (Global: 554th place; English: 368th place)

wimnet.ee.columbia.edu

doi.org (Global: 2nd place; English: 2nd place)