Pages that link to "Item:Q5591244"

The following pages link to An Enumeration Algorithm for Knapsack Problems (Q5591244):

Displaying 16 items.

• Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem (Q474490) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
• An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
• A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
• Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
• A characterisation of all feasible solutions to an integer program (Q1171507) (← links)
• Fourier-Motzkin elimination extension to integer programming problems (Q1226035) (← links)
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
• An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem (Q1368436) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
• Coefficient reduction for inequalities in 0–1 variables (Q4044367) (← links)