Pages that link to "Item:Q2643945"

The following pages link to An improved typology of cutting and packing problems (Q2643945):

Displaying 50 items.

• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
• A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
• Models and algorithms for fair layout optimization problems (Q610957) (← links)
• Bun splitting: a practical cutting stock problem (Q610959) (← links)
• A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• A novel hybrid tabu search approach to container loading (Q613519) (← links)
• A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
• A squeaky wheel optimisation methodology for two-dimensional strip packing (Q622159) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts (Q632697) (← links)
• The multiple container loading cost minimization problem (Q635154) (← links)
• A linear optimization approach to the combined production planning model (Q647983) (← links)
• Rectangle packing with additional restrictions (Q650936) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• Simultaneous optimization of production planning and inventory management of polyurethane foam plant (Q724341) (← links)
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
• Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
• An analysis of the integrated lot-sizing and cutting-stock problem formulation (Q821771) (← links)
• Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← links)
• Cutting optimization of structural tubes to build agricultural light aircrafts (Q839788) (← links)
• Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
• The constrained compartmentalised knapsack problem (Q868151) (← links)
• Two- and three-dimensional parametric packing (Q875405) (← links)
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
• Cutting and packing optimization. Problems modeling and solution methods. (Q931915) (← links)
• Reactive GRASP for the strip-packing problem (Q941532) (← links)
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← links)
• Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
• Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
• A beam search algorithm for the circular packing problem (Q960400) (← links)
• A beam search implementation for the irregular shape packing problem (Q964846) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
• Computing stable loads for pallets (Q992703) (← links)
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
• An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)