BPPLIB
From MaRDI portal
Software:35647
No author found.
Related Items (12)
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ Exact solution of network flow models with strong relaxations ⋮ The Meet-in-the-Middle Principle for Cutting and Packing Problems ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ Improved flow-based formulations for the skiving stock problem ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ Generalized relax-and-fix heuristic ⋮ 2DPackLib: a two-dimensional cutting and packing library
This page was built for software: BPPLIB
