haku: @author Sridharan, R. / yhteensä: 4
viite: 3 / 4
| Tekijä: | Sridharan, R. |
| Otsikko: | A Lagrangian heuristic for the capacitated plant location problem with side constraints |
| Lehti: | Journal of the Operational Research Society
1991 : JUL, VOL. 42:7, p. 579-585 |
| Asiasana: | LOCATION PROBLEM ALLOCATION HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | The location of plants is an important strategic decision for organizations. When each potential location has a capacity, that is, an upper bound on demand it can serve, the problem is known as the capacitated plant location problem. In the paper a Lagrangian relaxation-based heuristic for solving the capacitated plant-location problem with side constraints is presented. The side constraints are upper-bound constraints on disjoint subsets of the /0-1/ variables. Computational results are reported for some problems, having been obtained both on mainframes and on personal computer. |
SCIMA