The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
From MaRDI portal
Publication:3842995
DOI10.1111/j.1475-3995.1997.tb00093.xzbMath0906.90151OpenAlexW2155312717MaRDI QIDQ3842995
Petra Schwerin, Gerhard Wäscher
Publication date: 20 August 1998
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.1997.tb00093.x
Related Items (24)
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An improved typology of cutting and packing problems ⋮ Bin packing and related problems: general arc-flow formulation with graph compression ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ New bin packing fast lower bounds ⋮ A new destructive bounding scheme for the bin packing problem ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems ⋮ The bin covering with delivery problem, extended investigations for the online case ⋮ An enhanced grasshopper optimization algorithm to the Bin packing problem ⋮ A simulated annealing hyper-heuristic methodology for flexible decision support ⋮ Solving the one-dimensional bin packing problem with a weight annealing heuristic ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Characterizing the optimality gap and the optimal packings for the bin packing problem ⋮ New symmetry-less ILP formulation for the classical one dimensional bin-packing problem ⋮ Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) ⋮ Constrained circles packing test problems: all the optimal solutions known ⋮ SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing ⋮ Two heuristics for the one-dimensional bin-packing problem ⋮ Solving robust bin-packing problems with a branch-and-price approach ⋮ A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
Uses Software
Cites Work
- An instance of the cutting stock problem for which the rounding property does not hold
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- A typology of cutting and packing problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
This page was built for publication: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
