Pages that link to "Item:Q2491319"

The following pages link to Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319):

Displaying 12 items.

• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
• Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations (Q2830959) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• (Q4900928) (← links)
• Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
• Improved approximation for two-dimensional vector multiple knapsack (Q6639376) (← links)