| Article ID: | iaor19951870 |
| Country: | Canada |
| Volume: | 33 |
| Issue: | 2 |
| Start Page Number: | 123 |
| End Page Number: | 132 |
| Publication Date: | May 1995 |
| Journal: | INFOR |
| Authors: | Magazine M.J., Oguz O. |
| Keywords: | heuristics |
The concept of reducing the feasible range of decision variables or fixing the value of the variables is extended for the knapsack problem to include sets of variables. The ease of fixing these variables is measured by a stability index. The potential use of the concept is discussed in the context of approximation algorithms. Generalization to general zero-one problems is also considered.