haku: @author Einav, D. / yhteensä: 2
viite: 1 / 2
« edellinen | seuraava »
| Tekijä: | Berman, O. Einav, D. Handler, G. |
| Otsikko: | The constrained bottleneck problem in networks. |
| Lehti: | Operations Research
1990 : JAN_FEB, VOL. 38:1, p. 178-181 |
| Asiasana: | NETWORKS |
| Kieli: | eng |
| Tiivistelmä: | The focus is on problems that can be captured by two performance measures. One is a general cost function associated with a proposed solution. The other is a bottleneck measure that describes the worst, that is maximum cost, component of a solution which must be considered in addition to a general cost measure in a variety of problems. Algorithms are presented to solve three problems. In the first problem, the bottleneck, the maximum component link of the solution is minimized subject to a constraint on the generalized cost of the solution. In the second problem, the objective function and the constraint are reversed. In the third problem, the two criteria are simultaneously considered and all the optimum solutions are found. |
« edellinen | seuraava »
SCIMA