Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Roman M. Kolpakov / rank | |||
| Property / author | |||
| Property / author: Mikhail A. Posypkin / rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6188509 / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Roman M. Kolpakov / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Mikhail A. Posypkin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3655163 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization of schedules with precedence logical conditions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3074627 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3115678 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s106423071105011x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134343603 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem |
scientific article |
Statements
Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (English)
0 references
16 July 2013
0 references
0 references
