Opening book details…
Can I read Heuristics for the 0–1 Multidimensional Knapsack Problem on EtoBox?
Heuristics for the 0–1 Multidimensional Knapsack Problem by V. Boyer; M. Elkihel; D. El Baz is a Engineering article available to read on EtoBox.
What is Heuristics for the 0–1 Multidimensional Knapsack Problem about?
Two heuristics for the 0-1 multidimensional knapsack problem (MKP) are presented. The first one uses surrogate relaxation, and the relaxed problem is solved via a modified dynamic-programming algorithm. The heuristics provides a feasible solution for (MKP). The second one combines a limited-branch-and-cutprocedure with the previous approach, and tries to improve the bound obtained by exploring some nodes that have been rejected by the modified dynamic-programming algorithm. Computational experiences show that our approaches give better results than the existing heuristics, and thus permit one to obtain a smaller gap between the solution provided and an optimal solution.
Who reads Heuristics for the 0–1 Multidimensional Knapsack Problem?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- V. Boyer; M. Elkihel; D. El Baz
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0377-2217)
- Published
- 2009
- Language
- EN
- Field
- Engineering (Physical Sciences)