Pages that link to "Item:Q1433165"
From MaRDI portal
The following pages link to A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165):
Displaying 10 items.
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
- An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
- Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)
