Sciact
  • EN
  • RU

A Column Generation Based Heuristic for a Temporal Bin Packing Problem Full article

Journal Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349
Output data Year: 2021, Volume: 12755, Pages: 96-110 Pages count : 15 DOI: 10.1007/978-3-030-77876-7_7
Tags Bin packing; Column generation; Knapsack problem; Virtual machine
Authors Ratushnyi Alexey 1 , Kochetov Yury 2
Affiliations
1 Novosibirsk State University
2 Sobolev Institute of Mathematics
Cite: Ratushnyi A. , Kochetov Y.
A Column Generation Based Heuristic for a Temporal Bin Packing Problem
Lecture Notes in Computer Science. 2021. V.12755. P.96-110. DOI: 10.1007/978-3-030-77876-7_7 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85111369793
OpenAlex: W3168602418
Citing:
DB Citing
Scopus 4
OpenAlex 6
Altmetrics: