Article ID: | iaor200062 |
Country: | Netherlands |
Volume: | 86 |
Issue: | 1 |
Start Page Number: | 105 |
End Page Number: | 115 |
Publication Date: | Mar 1999 |
Journal: | Annals of Operations Research |
Authors: | Sforza Antonio, Avella Pasquale |
Keywords: | programming: linear |
Preprocessing plays a crucial role in solving combinatorial optimization problems. It can be realized through reduction tests which allow one to determine in advance the values that a set of variables will take in the optimal solution, thus reducing the size of an instance. Reduction tests can be summarily classified in two main families: those based on reduced costs and those based on logical implications. The first rely on reduced costs of the linear programming problem associated with continuous relaxation. The second are based on the special features of the problem and on combinatorial techniques. In this paper, some effective reduction tests for the