Pages that link to "Item:Q1251184"

The following pages link to Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184):

Displaying 20 items.

• Algorithm 37 (Q37554) (← links)
• A Lagrangean dual-based solution method for a special linear programming problem (Q581236) (← links)
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach (Q684336) (← links)
• A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
• The zero-one knapsack problem with equality constraint (Q1058453) (← links)
• An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure (Q1073717) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• A new enumeration scheme for the knapsack problem (Q1095029) (← links)
• Constructive dual methods for discrete programming (Q1101341) (← links)
• An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
• The vehicle routing problem with backhauls (Q1119178) (← links)
• Optimal and canonical solutions of the change making problem (Q1141080) (← links)
• Heuristic algorithms for the multiple knapsack problem (Q1148788) (← links)
• A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514) (← links)
• An algorithm for the solution of the 0-1 knapsack problem (Q1156694) (← links)
• An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems (Q1261329) (← links)
• Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
• Designing a minimal spanning tree network subject to a budget constraint (Q3799839) (← links)
• Modelling and solving an FMS part selection problem (Q3824087) (← links)