haku: @indexterm Quadratic programming / yhteensä: 24
viite: 24 / 24
« edellinen | seuraava »
| Tekijä: | Rosenberg, E. |
| Otsikko: | A nonlinear programming heuristic for computing optimal link capacities in a multi-hour alternate routing communications network. |
| Lehti: | Operations Research
1987 : MAY-JUN, VOL. 35:3, p. 354-364 |
| Asiasana: | NETWORKS TELECOMMUNICATION QUADRATIC PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | The problem of determining the optimal capacity of each link in a telecommunications network is studied. A complication in design is that the traffic between pairs of nodes varies with the time of day. In practice, networks use both one-link direct routing and two link alternate routing. Determining the optimal number of high-usage and final trunks requires balancing the reduced costs of direct trunks against the higher efficiency of final trunks, with the constraint that, in each hour, the blocking probability not exceed a given probability. This problem is called multi-hour engineering. To solve the general problem an iterative method, namely a recursive quadratic programming is applied. |
« edellinen | seuraava »
SCIMA