Pages that link to "Item:Q1797814"
From MaRDI portal
The following pages link to Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814):
Displaying 10 items.
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← 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 threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- (Q3141337) (← links)
- The Knapsack Problem with Conflict Graphs (Q3184613) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)