Pages that link to "Item:Q3220352"

The following pages link to A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (Q3220352):

Displaying 22 items.

• An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds (Q914548) (← links)
• Subset-sum problems with different summands: Computation (Q922292) (← links)
• A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
• Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
• Solving dense subset-sum problems by using analytical number theory (Q1262760) (← links)
• A competitive local search heuristic for the subset sum problem (Q1302591) (← links)
• A branch bound method for subset sum problem (Q1343509) (← links)
• A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• Coordinated lab-clinics: a tactical assignment problem in healthcare (Q1695040) (← links)
• On the best choice of a branching variable in the subset sum problem (Q1744347) (← links)
• Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
• An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244) (← links)
• Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
• Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
• Start Strategies of ACO Applied on Subset Problems (Q3075275) (← links)
• Sensitivity Analysis of ACO Start Strategies for Subset Problems (Q3075276) (← links)
• Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem (Q3616856) (← links)
• Comparison of Different ACO Start Strategies Based on InterCriteria Analysis (Q4609767) (← links)
• A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems (Q5101409) (← links)
• An exact algorithm for the subset sum problem (Q5955091) (← links)