An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
Year of publication: |
2016
|
---|---|
Authors: | Fleszar, Krzysztof |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 28.2016, 4, p. 703-720
|
Subject: | exact algorithm | two-dimensional cutting/packing | guillotine cuts | rotation | strip cutting | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Packproblem | Packing problem | Operations Research | Operations research |
-
A beam search approach to solve the convex irregular bin packing problem with guillotine cuts
Bennell, J.A., (2018)
-
Martin, Mateus, (2022)
-
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
- More ...
-
Solving the resource-constrained project scheduling problem by a variable neighbourhood search
Fleszar, Krzysztof, (2004)
-
An enumerative heuristic and reduction methods for the assembly line balancing problem
Fleszar, Krzysztof, (2003)
-
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
Hindi, Khalil S., (2004)
- More ...