Pages that link to "Item:Q2333144"

The following pages link to Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144):

Displaying 7 items.

• Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
• On recognizing staircase compatibility (Q2093277) (← links)
• An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
• Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
• New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem (Q6102886) (← links)
• A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times (Q6109310) (← links)
• Resource-constrained multi-project scheduling problem: a survey (Q6112820) (← links)