Contextual bandits learning-based branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with conflicts and time windows
Yanru Chen, Mujin Gao, Zongcheng Zhang, Junheng Li, M. I. M. Wahab, Yangsheng Jiang
| Year of publication: |
2025
|
|---|---|
| Authors: | Chen, Yanru ; Gao, Mujin ; Zhang, Zongcheng ; Li, Junheng ; Wahab, M. I. M. ; Jiang, Yangsheng |
| Published in: |
Transportation research : an international journal. - Oxford : Pergamon, Elsevier Science, ISSN 1878-5794, ZDB-ID 2013782-5. - Vol. 193.2025, Art.-No. 103866, p. 1-41
|
| Subject: | Branch-and-price-and-cut | Conflict graph | Contextual bandits | Time window | Two-dimensional vector packing problem | Packproblem | Packing problem | Algorithmus | Algorithm | Heuristik | Heuristics | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.tre.2024.103866 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10015449395