Pages that link to "Item:Q3392097"

The following pages link to An Exact Algorithm for Higher-Dimensional Orthogonal Packing (Q3392097):

Displaying 50 items.

• The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
• On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
• Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped (Q466345) (← links)
• Online square packing with gravity (Q476449) (← links)
• A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
• An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← 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)
• Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
• A general framework for bounds for higher-dimensional orthogonal packing problems. (Q703155) (← links)
• Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← links)
• A new heuristic algorithm for rectangle packing (Q883288) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← 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)
• Heuristics for container loading of furniture (Q1044119) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• VCS: A new heuristic function for selecting boxes in the single container loading problem (Q1652261) (← links)
• A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
• Product packing and stacking under uncertainty: a robust approach (Q1740542) (← 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)
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
• Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem (Q1926951) (← links)
• MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• The pallet loading problem: three-dimensional bin packing with practical constraints (Q2023993) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• A beam search algorithm for the biobjective container loading problem (Q2184131) (← links)
• Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
• Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (Q2378414) (← links)
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
• An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
• A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
• The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
• A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)