Pages that link to "Item:Q3893333"

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

Displaying 50 items.

• New approximability results for two-dimensional bin packing (Q261358) (← links)
• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
• A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
• A new lower bound for online strip packing (Q322552) (← links)
• Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
• Approximate composable truthful mechanism design (Q344791) (← links)
• A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
• An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
• An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
• Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
• Online square packing with gravity (Q476449) (← links)
• Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
• Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
• Dynamic multi-dimensional bin packing (Q616986) (← links)
• Recent advances on two-dimensional bin packing problems (Q697576) (← links)
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899) (← links)
• A note on the Kenyon-Remila strip-packing algorithm (Q763478) (← links)
• Network flows and non-guillotine cutting patterns (Q795062) (← links)
• Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
• Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
• Resource sharing combined with layout effects in high-level synthesis (Q851223) (← links)
• Two- and three-dimensional parametric packing (Q875405) (← links)
• Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
• Improved upper bounds for online malleable job scheduling (Q892840) (← links)
• On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
• On-line scheduling of parallel jobs in a list (Q954256) (← links)
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
• Three-dimensional packings with rotations (Q1017455) (← links)
• A note on online strip packing (Q1029271) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• Bin packing with divisible item sizes (Q1100914) (← links)
• Guillotineable bin packing: A genetic approach (Q1127222) (← links)
• A 2.5 times optimal algorithm for packing in two dimensions (Q1135860) (← links)
• An improved BL lower bound (Q1144945) (← links)
• Oriented aligned rectangle packing problem (Q1196022) (← links)
• Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
• An algorithm for the 2D guillotine cutting stock problem (Q1309924) (← links)
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
• An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370) (← links)
• Parametric on-line algorithms for packing rectangles and boxes. (Q1405228) (← links)
• Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
• Scheduling space-sharing for internet advertising (Q1600000) (← links)
• iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
• Co-scheduling algorithms for high-throughput workload execution (Q1702725) (← links)
• Offline first-fit decreasing height scheduling of power loads (Q1707831) (← links)
• New upper bounds for online strip packing (Q1751205) (← links)
• Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)