Pages that link to "Item:Q817562"

The following pages link to An exact algorithm for the knapsack sharing problem with common items (Q817562):

Displaying 10 items.

• The Subset Sum game (Q296979) (← links)
• An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
• Strategies in competing subset selection (Q367644) (← links)
• Maximin fairness in project budget allocation (Q510932) (← links)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• A new method for multiple attribute group decision-making with intuitionistic trapezoid fuzzy linguistic information (Q521697) (← links)
• Competitive subset selection with two agents (Q643027) (← links)
• Price of fairness for allocating a bounded resource (Q1752883) (← links)
• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (Q2003457) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)