Stochastic Greedy Algorithms for a Temporal Bin Packing Problem with Placement Groups › Research Explorer

Novosibirsk State University's Research Portal

Stochastic Greedy Algorithms for a Temporal Bin Packing Problem with Placement Groups

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review

Department of Mechanics and Mathematics

DOI

https://doi.org/10.1007/978-3-031-62792-7_14
Final published version

Alexander Turnaev
Artem Panin

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	199-211
Number of pages	13
ISBN (Print)	9783031627910
DOIs	https://doi.org/10.1007/978-3-031-62792-7_14
Publication status	Published - 2024
Event	23rd International Conference on Mathematical Optimization Theory and Operations Research - Омск, Russian Federation Duration: 30 Jun 2024 → 6 Jul 2024 Conference number: 23

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14766 LNCS

Conference

Conference	23rd International Conference on Mathematical Optimization Theory and Operations Research
Abbreviated title	MOTOR 2024
Country/Territory	Russian Federation
City	Омск
Period	30.06.2024 → 06.07.2024

Research areas

Stochastic algorithms, first-fit, placement constraints, placement groups, temporal bin packing

OECD FOS+WOS

1.01 MATHEMATICS

ID: 60501072