Pages that link to "Item:Q726225"

The following pages link to A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225):

Displaying 11 items.

• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)
• Heuristics for packing semifluids (Q2286867) (← links)
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
• An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
• Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)