Pages that link to "Item:Q3911418"

The following pages link to Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms (Q3911418):

Displaying 19 items.

• A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
• Recent advances on two-dimensional bin packing problems (Q697576) (← links)
• Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• Oriented aligned rectangle packing problem (Q1196022) (← links)
• Packing problems (Q1197916) (← links)
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
• The two-dimensional cutting stock problem revisited (Q1774168) (← links)
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH (Q1774522) (← links)
• Two-dimensional packing problems: a survey (Q1847188) (← links)
• The nesting problem in the leather manufacturing industry (Q1897382) (← links)
• Efficient heuristics for robot acquisition planning for a CIM system (Q1908995) (← links)
• Improved approximation for two dimensional strip packing with polynomial bounded width (Q2272375) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Approximate strip packing: revisited (Q2629852) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
• Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
• An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)