An Exact Algorithm for Higher-Dimensional Orthogonal Packing
From MaRDI portal
Publication:3392097
DOI10.1287/opre.1060.0369zbMath1167.90483arXivcs/0604045MaRDI QIDQ3392097
Sándor P. Fekete, Jörg Schepers, Jan C. van der Veen
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0604045
Related Items
A new heuristic algorithm for rectangle packing, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Heuristic approaches for the two- and three-dimensional knapsack packing problem, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, A new constraint programming approach for the orthogonal packing problem, The two-dimensional bin packing problem with variable bin sizes and costs, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A new exact method for the two-dimensional orthogonal packing problem
Uses Software