A Heuristic Algorithm for the Temporal Knapsack Problem Full article
| Conference |
Optimization Problems of Complex Systems : International Asian School-Seminar 14-22 Aug 2023 , Новосибирск |
||
|---|---|---|---|
| Source | 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS) Compilation, IEEE. 2023. 6 c. ISBN 9798350331134. |
||
| Output data | Year: 2023, Pages: 31-35 Pages count : 5 DOI: 10.1109/opcs59592.2023.10275324 | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0019 |
Cite:
Glotova Y.
, Kochetov Y.
A Heuristic Algorithm for the Temporal Knapsack Problem
In compilation 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS). – IEEE., 2023. – C.31-35. – ISBN 9798350331134. DOI: 10.1109/opcs59592.2023.10275324 Scopus OpenAlex
A Heuristic Algorithm for the Temporal Knapsack Problem
In compilation 2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS). – IEEE., 2023. – C.31-35. – ISBN 9798350331134. DOI: 10.1109/opcs59592.2023.10275324 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85175419808 |
| OpenAlex: | W4387620826 |
Citing:
Пока нет цитирований