ナップサック問題 (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "ナップサック問題" in Japanese language version.

refsWebsite

Global rank Japanese rank

8doi.org

2^nd place

6^th place

3worldcat.org

5^th place

19^th place

2arxiv.org

69^th place

227^th place

1psu.edu

207^th place

1,812^th place

1nus.edu.sg

2,776^th place

7,459^th place

1wikipedia.org

low place

1technion.ac.il

low place

1columbia.edu

488^th place

1,974^th place

1harvard.edu

18^th place

107^th place

1sciencedirect.com

149^th place

558^th place

1springer.com

274^th place

596^th place

arxiv.org

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. https://doi.org/10.1145/3473713.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa; Yokomaku, Haruki (2019-09-22), Online Knapsack Problems with a Resource Buffer, arXiv:1909.10016

columbia.edu

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

Kulik, A.; Shachnai, H. (2010). “There is no EPTAS for two dimensional knapsack”. Inf. Process. Lett. 110 (16): 707–712. doi:10.1016/j.ipl.2010.05.031.
Chandra Chekuri and Sanjeev Khanna (2005). “A PTAS for the multiple knapsack problem”. SIAM Journal on Computing 35 (3): 713–728. doi:10.1137/s0097539700382820.
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.
Gallo, G.; Hammer, P. L.; Simeone, B. (1980). “Quadratic knapsack problems”. Combinatorial Optimization. Mathematical Programming Studies. 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. https://doi.org/10.1145/3473713.
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (2015-01-11). “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 (2014-09-01). “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 (2014-06-26). “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.

harvard.edu

ui.adsabs.harvard.edu

Witzgall, C. (1975). “Mathematical methods of site selection for Electronic Message Systems (EMS)”. NASA Sti/Recon Technical Report N (NBS Internal report) 76: 18321. Bibcode: 1975STIN...7618321W.

nus.edu.sg

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.

psu.edu

citeseerx.ist.psu.edu

Chang, T. J., et al. Heuristics for Cardinality Constrained Portfolio Optimization. Technical Report, London SW7 2AZ, England: The Management School, Imperial College, May 1998

sciencedirect.com

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

springer.com

link.springer.com

Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (2014-09-01). “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

cs.technion.ac.il

Kulik, A.; Shachnai, H. (2010). “There is no EPTAS for two dimensional knapsack”. Inf. Process. Lett. 110 (16): 707–712. doi:10.1016/j.ipl.2010.05.031.

wikipedia.org

en.wikipedia.org

Kulik, A.; Shachnai, H. (2010). “There is no EPTAS for two dimensional knapsack”. Inf. Process. Lett. 110 (16): 707–712. doi:10.1016/j.ipl.2010.05.031.

worldcat.org

search.worldcat.org

Han, Xin; Kawase, Yasushi; Makino, Kazuhisa (2015-01-11). “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 (2014-09-01). “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 (2014-06-26). “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.