Pages that link to "Item:Q293250"

The following pages link to A 13/12 approximation algorithm for bin packing with extendable bins (Q293250):

Displaying 14 items.

• Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations (Q724114) (← links)
• Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
• Approximation algorithms for extensible bin packing (Q880529) (← links)
• Combinatorial optimization problems in wireless switch design (Q926564) (← links)
• On-line scheduling with extendable working time on a small number of machines (Q1007518) (← links)
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size (Q1293199) (← links)
• Applying extra-resource analysis to load balancing. (Q1588056) (← links)
• Scheduling jobs with normally distributed processing times on parallel machines (Q2242242) (← links)
• Vector assignment schemes for asymmetric settings (Q2491210) (← links)
• Optimal preemptive scheduling for general target functions (Q2581760) (← links)
• Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
• State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems (Q5084656) (← links)
• Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) (← links)
• Adaptive Bin Packing with Overflow (Q5870378) (← links)