Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://hdl.handle.net/11701/36156
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Plotkin, Artyom V. | - |
dc.date.accessioned | 2022-04-14T11:27:59Z | - |
dc.date.available | 2022-04-14T11:27:59Z | - |
dc.date.issued | 2022-03 | - |
dc.identifier.citation | Plotkin А.V. Fast algorithm for quadratic knapsack problem. Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 2022, vol. 9 (67), issue 1, pp. 76–84. | en_GB |
dc.identifier.other | https://doi.org/10.21638/spbu01.2022.108 | - |
dc.identifier.uri | http://hdl.handle.net/11701/36156 | - |
dc.description.abstract | The paper considers a quadratic programming problem with a strictly convex separable objective function, a single linear constraint, and two-sided constraints on variables. This problem is commonly called the Convex Knapsack Separable Quadratic Problem, or CKSQP for short. We are interested in an algorithm for solving CKSQP with a linear time complexity. The papers devoted to this topic contain inaccuracies in the description of algorithms and ineffective implementations. In this work, the existing difficulties were overcome. | en_GB |
dc.language.iso | ru | en_GB |
dc.publisher | St Petersburg State University | en_GB |
dc.relation.ispartofseries | Vestnik of St Petersburg University. Mathematics. Mechanics. Astronomy;Volume 9; Issue 1 | - |
dc.subject | quadratic programming | en_GB |
dc.subject | knapsack problem | en_GB |
dc.subject | fast algorithms | en_GB |
dc.title | Fast algorithm for quadratic knapsack problem | en_GB |
dc.type | Article | en_GB |
Располагается в коллекциях: | Issue 1 |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
76-84.pdf | 301,28 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.