Pages that link to "Item:Q1155514"

The following pages link to A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514):

Displaying 16 items.

• A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
• An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
• A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
• An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
• Heuristic algorithms for the multiple knapsack problem (Q1148788) (← links)
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
• An application of the multiple knapsack problem: the self-sufficient marine (Q1752270) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• A new upper bound for the multiple knapsack problem (Q2668625) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver (Q5387622) (← links)
• Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights (Q6068681) (← links)
• A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem (Q6595340) (← links)