The two-dimensional finite bin packing problem. II: New lower and upper bounds
From MaRDI portal
Publication:1432017
DOI10.1007/s10288-002-0006-yzbMath1097.90033OpenAlexW2029484438MaRDI QIDQ1432017
Aristide Mingozzi, Marco Antonio Boschetti
Publication date: 11 June 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-002-0006-y
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Constrained order packing: comparison of heuristic approaches for a new bin packing problem, A hybrid algorithm for constrained order packing, Sequential heuristic for the two-dimensional bin-packing problem, A variable neighborhood descent approach for the two-dimensional bin packing problem, A new exact method for the two-dimensional orthogonal packing problem, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Space defragmentation for packing problems, A new destructive bounding scheme for the bin packing problem, A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing, A survey of dual-feasible and superadditive functions, Routing problems with loading constraints, The off-line group seat reservation problem, An introduction to the two‐dimensional rectangular cutting and packing problem, Algorithms for nesting with defects, The three-dimensional knapsack problem with balancing constraints, A new lower bound for the non-oriented two-dimensional bin-packing problem, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, Unnamed Item, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, Exact solution techniques for two-dimensional cutting and packing, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, Bidimensional packing by bilinear programming, Deterministic model for customized pilot manufacture production with various backplane sizes, The two-dimensional bin packing problem with variable bin sizes and costs
