A combined approach to the solution to the general one-dimensional cutting stock problem
Computers and Operations Research
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers and Operations Research
Multi-dimensional bin packing problems with guillotine constraints
Computers and Operations Research
A new graph-theoretical model for k-dimensional guillotine-cutting problems
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
INFORMS Journal on Computing
Computers and Operations Research
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
Computers and Operations Research
Biased random-key genetic algorithms for combinatorial optimization
Journal of Heuristics
LP bounds in various constraint programming approaches for orthogonal packing
Computers and Operations Research
A New Graph-Theoretical Model for the Guillotine-Cutting Problem
INFORMS Journal on Computing
Hi-index | 0.01 |