Cited in
(29)- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
- Extreme point-based heuristics for three-dimensional bin packing
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Routing problems with loading constraints
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Zephyrus2
- A MIP-based slicing heuristic for three-dimensional bin packing
- Space and time allocation in a shipyard assembly hall
- The pallet loading problem: three-dimensional bin packing with practical constraints
- Constraints in container loading -- a state-of-the-art review
- A global search framework for practical three-dimensional packing with variable carton orientations
- Multi-dimensional bin packing problems with guillotine constraints
- Packlib2
- TSPACK
- 2DCPackGen
- TSpack
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Ts2pack
- BRP
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Three-dimensional bin packing problem with variable bin height
- KeY-ABS
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Space defragmentation for packing problems
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
This page was built for software: Algorithm 864
