haku: @indexterm LINEAR PROGRAMMING / yhteensä: 544
viite: 195 / 544
| Tekijä: | Fisher, M. L. Kedia, P. |
| Otsikko: | Optimal solution of set covering/partitioning problems using dual heuristics. |
| Lehti: | Management Science
1990 : JUN, VOL. 36:6, p. 674-688 |
| Asiasana: | LINEAR PROGRAMMING HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | An algorithm is presented for a mixed set covering/partitioning model that includes as special cases the well known set covering problem and set partitioning problem. The novel feature of the algorithm is the use of continuous heuristics applied to the dual of the linear programming relaxation to provide lower bounds for a branch and bound algorithm. The heuristics are continuous adaptations of the well-known greedy and 3-opt methods that have been applied to a variety of combinatorial optimization problems. |
SCIMA