Heuristic approaches for the two- and three-dimensional knapsack packing problem

From MaRDI portal
Revision as of 18:47, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:958438

DOI10.1016/J.COR.2007.12.004zbMath1162.90542OpenAlexW2058038705WikidataQ58826413 ScholiaQ58826413MaRDI QIDQ958438

Jens Egeblad, David Pisinger

Publication date: 4 December 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.12.004




Related Items (31)

2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problemsAn iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problemKnapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problemsA theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problemA best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problemThe load-balanced multi-dimensional bin-packing problemA cutting plane method and a parallel algorithm for packing rectangles in a circular containerAn MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cutsAn EDA for the 2D knapsack problem with guillotine constraintMaximizing revenue with allocation of multiple advertisements on a Web bannerThe three-dimensional knapsack problem with balancing constraintsSolving packing problems by a distributed global optimization algorithmAn iterated local search algorithm for a place scheduling problemConsideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature reviewTwo-dimensional knapsack-block packing problemA new load balance methodology for container loading problem in road transportationA least wasted first heuristic algorithm for the rectangular packing problemA global search framework for practical three-dimensional packing with variable carton orientationsA hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problemA fast heuristic for a three-dimensional non-convex domain loading problemAn efficient deterministic heuristic for two-dimensional rectangular packingPractical constraints in the container loading problem: comprehensive formulations and exact algorithmA comparative review of 3D container loading algorithmsThe maximum diversity assortment selection problemData Structures for Higher-Dimensional Rectilinear PackingHybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problemPlacement of two- and three-dimensional irregular shapes for inertia moment and balanceThree-dimensional bin packing problem with variable bin heightHeuristics for container loading of furnitureModel Development and Optimization for Space Engineering: Concepts, Tools, Applications, and PerspectivesConstraints in container loading -- a state-of-the-art review


Uses Software



Cites Work




This page was built for publication: Heuristic approaches for the two- and three-dimensional knapsack packing problem