Algorithm 864

swMATH5045MaRDI QIDQ17185FDOQ17185

Author name not available (Why is that?)

Cited In (21)

• A global search framework for practical three-dimensional packing with variable carton orientations
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• Routing problems with loading constraints
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• 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
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• Space and time allocation in a shipyard assembly hall
• Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
• The pallet loading problem: three-dimensional bin packing with practical constraints
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• Extreme point-based heuristics for three-dimensional bin packing
• Space defragmentation for packing problems
• Multi-dimensional bin packing problems with guillotine constraints
• Three-dimensional bin packing problem with variable bin height
• A MIP-based slicing heuristic for three-dimensional bin packing
• Constraints in container loading -- a state-of-the-art review
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

This page was built for software: Algorithm 864