Pages that link to "Item:Q853022"

The following pages link to Computing redundant resources for the resource constrained project scheduling problem (Q853022):

Displaying 9 items.

• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
• On the extremality of maximal dual feasible functions (Q433834) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
• Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
• Redundant cumulative constraints to compute preemptive bounds (Q1686060) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)