haku: @indexterm location problem / yhteensä: 219
viite: 141 / 219
| Tekijä: | Chaudhry, S. S. McCormick, S. T. Moon, I. D. |
| Otsikko: | Locating independent facilities with maximum weight : greedy heuristics. |
| Lehti: | Omega
1986 : VOL. 14:5, p. 383-389 |
| Asiasana: | LOCATION PROBLEM HEURISTIC METHODS MATHEMATICAL MODELS |
| Kieli: | eng |
| Tiivistelmä: | The problem is to locate a maximum-weight set of facilities such that no two are closer than a given distance from each other. The unweighted version is equivalent to the maximum independent set problem is graph theory. The presented four greedy heuristics run almost twice as fast as the branch-and-bound procedure for relative large size problems. These heuristics all have bad worst-case behavior. Greedy heuristics perform quite satisfactory in tests on randomly generated problems. |
SCIMA