Pages that link to "Item:Q5704177"

The following pages link to A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing (Q5704177):

Displaying 40 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)
• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← 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)
• The off-line group seat reservation problem (Q613435) (← links)
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
• A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
• Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• MIP-based heuristic for non-standard 3D-packing problems (Q1029557) (← links)
• A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
• On the two-dimensional knapsack problem (Q1433651) (← links)
• A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
• Space defragmentation for packing problems (Q1926954) (← links)
• A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
• A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← links)
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
• A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
• A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• A comparative review of 3D container loading algorithms (Q2803269) (← links)
• An efficient deterministic optimization approach for rectangular packing problems (Q2868912) (← links)
• One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM (Q3503066) (← links)
• Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
• Efficient algorithms for orthogonal packing problems (Q5413218) (← links)
• Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
• Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5917883) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority (Q6092554) (← links)