Pages that link to "Item:Q2883626"
From MaRDI portal
The following pages link to A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626):
Displaying 7 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124) (← links)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
