scientific article; zbMATH DE number 1175962
From MaRDI portal
Publication:4398379
zbMath1068.90509MaRDI QIDQ4398379
Harald Dyckhoff, Guntram Scheithauer, Johannes Terno
Publication date: 19 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (45)
Families of non-IRUP instances of the one-dimensional cutting stock problem ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ Cutting optimization of structural tubes to build agricultural light aircrafts ⋮ A dynamic adaptive local search algorithm for the circular packing problem ⋮ An integrated cutting stock and sequencing problem ⋮ Optimising the cutting of wood fibre plates in the hardboard industry ⋮ An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems ⋮ The constrained compartmentalised knapsack problem ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ Bun splitting: a practical cutting stock problem ⋮ Space and time allocation in a shipyard assembly hall ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Cube packing. ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Decomposition algorithm for geometric objects in 2D packing and cutting problems ⋮ Characterization and modelling of guillotine constraints ⋮ Approximate algorithms for constrained circular cutting problems ⋮ On the two-dimensional knapsack problem ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ An enumeration scheme to generate constrained exact checkerboard patterns ⋮ The load planning problem for double-stack intermodal trains ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ Covering a polygonal region by rectangles ⋮ Chips on wafers, or packing rectangles into grids ⋮ Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application ⋮ An integer programming model for two- and three-stage two-dimensional cutting stock problems ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ Mathematical modeling of interactions of primary geometric 3D objects ⋮ Tighter relaxations for the cutting stock problem ⋮ Approximation algorithm for the oriented two-dimensional bin packing problem ⋮ MIP-based heuristic for non-standard 3D-packing problems ⋮ A branch-and-price algorithm for the two-dimensional level strip packing problem ⋮ An efficient approach for the multi-pallet loading problem ⋮ New lower bounds for the three-dimensional finite bin packing problem ⋮ Interval estimation of alternatives in decision-making problems ⋮ Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem ⋮ L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing ⋮ Heuristics for the container loading problem ⋮ Two-dimensional packing problems: a survey ⋮ Heuristic algorithms for the three-dimensional bin packing problem ⋮ A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths ⋮ An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey
This page was built for publication:
