The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
From MaRDI portal
Publication:3842995
Recommendations
- Heuristic solution of open bin packing problems
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- On the generalized bin packing problem
- Application of genetic algorithm for the bin packing problem with a new representation scheme
- scientific article; zbMATH DE number 1187157
Cites work
- A typology of cutting and packing problems
- 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
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Solving binary cutting stock problems by column generation and branch- and-bound
Cited in
(30)- 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
- BPPLIB: a library for bin packing and cutting stock problems
- Measuring instance difficulty for combinatorial optimization problems
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- 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
- Solving robust bin-packing problems with a branch-and-price approach
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- An enhanced grasshopper optimization algorithm to the Bin packing problem
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Heuristic solution of open bin packing problems
- An improved typology of cutting and packing problems
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- Constrained circles packing test problems: all the optimal solutions known
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- A simulated annealing hyper-heuristic methodology for flexible decision support
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional 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
- A new destructive bounding scheme for the bin packing problem
- Local-search based heuristics for advertisement scheduling
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- \textsc{Athanor}: local search over abstract constraint specifications
- Domain-independent dynamic programming
- New bin packing fast lower bounds
This page was built for publication: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3842995)
