haku: @author Wong, C.K. / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
| Tekijä: | Cai, X. Sha, D. Wong, C.K. |
| Otsikko: | Time-varying minimum cost flow problems |
| Lehti: | European Journal of Operational Research
2001 : JUN, VOL. 131:2, p. 352-374 |
| Asiasana: | DYNAMIC PROGRAMMING |
| Vapaa asiasana: | MINIMUM COST FLOW TIME-VARYING NETWORK |
| Kieli: | eng |
| Tiivistelmä: | In this paper, the authors study a minimum cost flow problem on a time-varying network. The objective is to find an optimal schedule to send a flow from the origin (the source of vertex) to its destination (the sink vertex) with the minimum cost, subject to the constraint that the flow must arrive at the destination before a deadline T. |
« edellinen | seuraava »
SCIMA