A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands
Year of publication: |
2022
|
---|---|
Authors: | Queiroz, Layane Rodrigues de Souza ; Andretta, Marina |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 6, p. 3486-3513
|
Subject: | irregular strip packing problem | stochastic programming | uncertain demands | variable neighborhood search | Theorie | Theory | Packproblem | Packing problem | Algorithmus | Algorithm | Operations Research | Operations research |
-
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
Umetani, Shunji, (2022)
-
A semi-continuous MIP model for the irregular strip packing problem
Leao, Aline A. S., (2016)
-
Kimms, Alf, (2023)
- More ...
-
Andretta, Marina, (2013)
-
Robust mixed-integer linear programming models for the irregular strip packing problem
Cherri, Luiz H., (2016)
-
New exact algorithms for planar maximum covering location by ellipses problems
Tedeschi, Danilo, (2021)
- More ...