Pages that link to "Item:Q4105496"

The following pages link to An Efficient Algorithm for the 0-1 Knapsack Problem (Q4105496):

Displaying 32 items.

• Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships (Q556008) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• Solving capacitated clustering problems (Q799059) (← links)
• Coordinated production scheduling for make-to-order manufacturing (Q919989) (← links)
• Single-vendor multi-buyer inventory coordination under private information (Q933523) (← links)
• A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
• The zero-one knapsack problem with equality constraint (Q1058453) (← links)
• Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
• Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• An integer programming model for the allocation of databases in a distributed computer system (Q1083877) (← links)
• Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
• Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
• An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
• Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
• A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134) (← links)
• The 0-1 knapsack problem with multiple choice constraints (Q1248462) (← links)
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184) (← links)
• An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
• File allocation involving worst case response times and link capacities: Model and solution procedure (Q1261331) (← links)
• Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← 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)
• An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
• Formulating and solving production planning problems (Q1806882) (← links)
• Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben (Q3804451) (← links)
• An improved enumeration for pure 0-1 programs (Q3978584) (← links)
• An algorithm for the 0/1 Knapsack problem (Q4149230) (← links)
• The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)
• Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)