Bin packing problem with time lags
Year of publication: |
2022
|
---|---|
Authors: | Rivera Letelier, Orlando ; Clautiaux, François ; Sadykov, Ruslan |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 4, p. 2249-2270
|
Subject: | algorithms | branch and bound | cutting planes | cutting stock | integer programming | production-scheduling | relaxation | Packproblem | Packing problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
-
A branch & bound algorithm for cutting and packing irregularly shaped pieces
Alvarez-Valdes, Ramon, (2013)
- More ...
-
Clautiaux, François, (2019)
-
Models and algorithms for configuring and testing prototype cars
Clautiaux, François, (2025)
-
Production scheduling for strategic open pit mine planning : a mixed-integer programming approach
Rivera Letelier, Orlando, (2020)
- More ...