Pages that link to "Item:Q4530648"

The following pages link to The Three-Dimensional Bin Packing Problem (Q4530648):

Displaying 50 items.

• A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem (Q299777) (← links)
• A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
• The multiple container loading problem with preference (Q320625) (← links)
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
• A beam search approach to the container loading problem (Q336892) (← links)
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
• Fast machine reassignment (Q338866) (← links)
• An exact strip packing algorithm based on canonical forms (Q339635) (← links)
• Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
• The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
• Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
• On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints (Q367235) (← links)
• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
• Container packing problem with balance constraints (Q480768) (← links)
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
• Space and time allocation in a shipyard assembly hall (Q610963) (← links)
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
• Optimal rectangle packing (Q610984) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• The off-line group seat reservation problem (Q613435) (← links)
• The multiple container loading cost minimization problem (Q635154) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← links)
• Two- and three-dimensional parametric packing (Q875405) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
• Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
• A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
• A particular approach for the three-dimensional packing problem with additional constraints (Q976016) (← links)
• Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
• Three-dimensional bin packing problem with variable bin height (Q1039777) (← links)
• A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning (Q1042176) (← links)
• A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
• Minimal surface convex hulls of spheres (Q1633782) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• A MIP-based slicing heuristic for three-dimensional bin packing (Q1686545) (← links)
• Product packing and stacking under uncertainty: a robust approach (Q1740542) (← links)
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem (Q1752837) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (Q1754206) (← links)
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP (Q1761144) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• A global search framework for practical three-dimensional packing with variable carton orientations (Q1761175) (← links)
• Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)