Pages that link to "Item:Q3220353"
From MaRDI portal
The following pages link to Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program (Q3220353):
Displaying 10 items.
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- On the calculation of true and pseudo penalties in multiple choice integer programming (Q1183620) (← links)
- A decomposition technique for mixed integer programming problems (Q1206388) (← links)
- Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
- Solving integer programs with a few important binary gub constraints (Q1309895) (← links)
- (Q4190438) (← links)
- A Genetic Algorithm for the Multiple-Choice Integer Program (Q4367267) (← links)
- Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)