Pages that link to "Item:Q5301142"

The following pages link to LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility (Q5301142):

Displaying 7 items.

• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
• The value of integrating loading and routing (Q1752774) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
• The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)