Pages that link to "Item:Q3401330"

The following pages link to One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330):

Displaying 9 items.

• Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
• Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← 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)
• Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)