Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cor.2021.105288 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3139099132 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:58, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Compact integer linear programming formulations for the temporal bin packing problem with fire-ups |
scientific article |
Statements
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (English)
0 references
7 March 2022
0 references
cutting and packing
0 references
temporal bin packing problem
0 references
fire-ups
0 references
integer programming
0 references
reduction methods
0 references