A general framework for bounds for higher-dimensional orthogonal packing problems.

DOI10.1007/s001860400376zbMath1076.90049arXivcs/0402044OpenAlexW1713438669MaRDI QIDQ703155

Sándor P. Fekete, Jörg Schepers

Publication date: 11 January 2005

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0402044

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (45)

A hybrid algorithm for constrained order packing ⋮ Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ A theoretical and experimental study of fast lower bounds 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 ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ Optimal rectangle packing ⋮ A survey of dual-feasible and superadditive functions ⋮ On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Conservative scales in packing problems ⋮ A new quasi-human algorithm for solving the packing problem of unit equilateral triangles ⋮ A new constraint programming approach for the orthogonal packing problem ⋮ Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution ⋮ Relations between capacity utilization, minimal bin size and bin number ⋮ 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 ⋮ A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates ⋮ Heuristic approaches for the two- and three-dimensional knapsack 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 ⋮ Unnamed Item ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ Determining the best shipper sizes for sending products to customers ⋮ An agent-based approach to the two-dimensional guillotine bin packing problem ⋮ Bidimensional packing by bilinear programming ⋮ A branch and bound algorithm for the strip packing problem ⋮ A branch-and-price algorithm for the two-dimensional level strip packing problem ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem ⋮ New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem ⋮ Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems

This page was built for publication: A general framework for bounds for higher-dimensional orthogonal packing problems.