Narrow search
Showing 1 - 4 of 4
Cover Image
Heuristics for the 0–1 multidimensional knapsack problem
Boyer, V.; Elkihel, M.; El Baz, D. - In: European journal of operational research : EJOR 199 (2009) 3, pp. 658-664
Persistent link: https://www.econbiz.de/10008259559
Cover Image
A dynamic programming method with lists for the knapsack sharing problem
Boyer, V.; El Baz, D.; Elkihel, M. - In: Computers & industrial engineering : CAIE ; an … 61 (2011) 2, pp. 274-279
Persistent link: https://www.econbiz.de/10009291399
Cover Image
Improved time and space complexity for Kianfar's inequality rotation algorithm
Baz, D. El; Elkihel, M.; Gely, L.; Plateau, G. - In: European Journal of Industrial Engineering 3 (2009) 1, pp. 90-98
In this paper, constraint rotation techniques are considered for preconditioning 0?1 knapsack problems. These techniques permit one to generate new inequalities by means of rotation of the original ones in order to approach the convex hull associated with the feasible integer points. The time...
Persistent link: https://www.econbiz.de/10005553173
Cover Image
Improved time and space complexity for Kianfar's inequality rotation algorithm
Baz, D. El; Elkihel, M.; Gely, L.; Plateau, G. - In: European Journal of Industrial Engineering 3 (2009) 1, pp. 90-98
In this paper, constraint rotation techniques are considered for preconditioning 0–1 knapsack problems. These techniques permit one to generate new inequalities by means of rotation of the original ones in order to approach the convex hull associated with the feasible integer points. The...
Persistent link: https://www.econbiz.de/10008563659