BPPLIB
From MaRDI portal
Software:35647
swMATH23883MaRDI QIDQ35647FDOQ35647
Author name not available (Why is that?)
Cited In (12)
- Exact solution techniques for two-dimensional cutting and packing
- Generalized relax-and-fix heuristic
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- 2DPackLib: a two-dimensional cutting and packing library
- Improved flow-based formulations for the skiving stock problem
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- 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
- A branch-and-price algorithm for the temporal bin packing problem
This page was built for software: BPPLIB
