Pages that link to "Item:Q844527"
From MaRDI portal
The following pages link to The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527):
Displaying 6 items.
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- Solving huge size instances of the optimal diversity management problem (Q844532) (← links)
- A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- A dynamic programming approach for a class of robust optimization problems (Q2817842) (← links)
- Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154) (← links)