Pages that link to "Item:Q4074670"

The following pages link to Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670):

Displaying 16 items.

• The zero-one knapsack problem with equality constraint (Q1058453) (← links)
• A new enumeration scheme for the knapsack problem (Q1095029) (← links)
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
• An algorithm for the solution of the 0-1 knapsack problem (Q1156694) (← links)
• An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
• New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
• A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
• Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem (Q2987849) (← links)
• A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben (Q3804451) (← links)
• A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926) (← links)
• An algorithm for the 0/1 Knapsack problem (Q4149230) (← links)