The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
From MaRDI portal
Publication:1429289
DOI10.1007/s10288-002-0005-zzbMath1062.90051OpenAlexW2029621259MaRDI QIDQ1429289
Aristide Mingozzi, Marco Antonio Boschetti
Publication date: 18 May 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-002-0005-z
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Prospective Network Flow Models and Algorithms for Bin Packing Problems, Ond-threshold graphs andd-dimensional bin packing, A hybrid algorithm for constrained order packing, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A new exact method for the two-dimensional orthogonal packing problem, A Lagrangian heuristic for sprint planning in agile software development, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Space defragmentation for packing problems, 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, Lower and upper bounds for the bin packing problem with fragile objects, Conservative scales in packing problems, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, A new constraint programming approach for the orthogonal packing problem, Using dual feasible functions to construct fast lower bounds for routing and location problems, A new exact method for the two-dimensional bin-packing problem with fixed orientation, 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, LP bounds in various constraint programming approaches for orthogonal packing, Lower bounds for three-dimensional multiple-bin-size bin packing problems, New lower bounds for bin packing problems with conflicts, Unnamed Item, 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, A branch and bound algorithm for the strip packing problem, The two-dimensional bin packing problem with variable bin sizes and costs
