BPPLIB
From MaRDI portal
Cited in
(33)- Exact solution techniques for two-dimensional cutting and packing
- 2DPackLib
- Generalized relax-and-fix heuristic
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- 2DPackLib: a two-dimensional cutting and packing library
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Improved flow-based formulations for the skiving stock problem
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- VRPH
- libcgrpp
- SimCList
- race
- ACOTSP
- CVRPSEP
- Kangaroo
- CUTGEN1
- 2DCPackGen
- TSpack
- Bison
- FrogCOL
- POPMUSIC
- TaxiSimulation
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Restrict-And-Fix
- Capping methods for the automatic configuration of optimization algorithms
- ACVIZ
- CAPOPT
- HHBQP
- Exact solution of network flow models with strong relaxations
- Cvrplib
- VRPSolver
- A branch-and-price algorithm for the temporal bin packing problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
This page was built for software: BPPLIB
