A new exact algorithm for general orthogonal d-dimensional knapsack problems
From MaRDI portal
Publication:826081
DOI10.1007/3-540-63397-9_12zbMath1482.90182OpenAlexW2033745363MaRDI QIDQ826081
Jörg Schepers, Sándor P. Fekete
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/3-540-63397-9_12
Related Items
A population heuristic for constrained two-dimensional non-guillotine cutting ⋮ A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem ⋮ An improved typology of cutting and packing problems ⋮ PackLib\(^{2}\): an integrated library of multi-dimensional packing problems ⋮ 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 hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem ⋮ On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ Characterization and modelling of guillotine constraints ⋮ On the two-dimensional knapsack problem ⋮ Two-dimensional knapsack-block packing problem ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ 2DPackLib: a two-dimensional cutting and packing library ⋮ Constraints in container loading -- a state-of-the-art review
This page was built for publication: A new exact algorithm for general orthogonal d-dimensional knapsack problems
