Pages that link to "Item:Q1761940"

The following pages link to Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940):

Displaying 9 items.

• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
• Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
• Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)