| Tekijä: | Guignard, M. |
| Otsikko: | A lagrangean dual ascent algorithm for simple plant location problems. |
| Lehti: | European Journal of Operational Research
1988 : MAY, VOL. 35:2, p. 193-200 |
| Asiasana: | INTEGER PROGRAMMING LOCATION PROBLEM HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | It is proposed to strengthen the separable Langrangean relaxation of the Simple Plant Location Problem by using Benders inequalities generated during a Lagrangean dual ascent procedure. These inequalities are expressed in terms of 0-1 variables only, and they can be used as knapsack constraints in the pure integer part of the Langrangean relaxation. It is shown how coupling this technique with a good primal heuristic can substantially reduce integrality gaps. |
SCIMA