.png){kind=icon}
.png){kind=icon}
Return
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2008.11.036.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the variables to fix either permanently or temporarily and on the other hand to construct feasible solutions of the problem. Adaptations of this mechanism are proposed to explore different parts of the search space and to enhance the behaviour of the algorithm. Encouraging results are presented when tested on the correlated instances of the 0-1 multidimensional knapsack problem. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Heuristics
Exact methods
Fixation techniques
Knapsack
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W