Pages that link to "Item:Q431007"

The following pages link to Clique-based facets for the precedence constrained knapsack problem (Q431007):

Displaying 8 items.

• The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
• Subset sum problems with digraph constraints (Q1631654) (← links)
• The knapsack problem with neighbour constraints (Q1932367) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• A strengthened formulation and cutting planes for the open pit mine production scheduling problem (Q2270449) (← links)
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
• Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)