The following pages link to BPPLIB (Q35647):
Displayed 12 items.
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)