Pages that link to "Item:Q958438"

The following pages link to Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438):

Displaying 31 items.

• 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems (Q296590) (← links)
• The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
• A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
• Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
• A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
• Three-dimensional bin packing problem with variable bin height (Q1039777) (← 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)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• A new load balance methodology for container loading problem in road transportation (Q1754193) (← links)
• A global search framework for practical three-dimensional packing with variable carton orientations (Q1761175) (← links)
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
• An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
• Solving packing problems by a distributed global optimization algorithm (Q1955364) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
• An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← links)
• A comparative review of 3D container loading algorithms (Q2803269) (← links)
• Data Structures for Higher-Dimensional Rectilinear Packing (Q2815459) (← links)
• Placement of two- and three-dimensional irregular shapes for inertia moment and balance (Q3401333) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
• An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727) (← links)
• Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)