haku: @author Padman, R. / yhteensä: 4
viite: 4 / 4
« edellinen | seuraava »
| Tekijä: | Ali, A. I. Padman, R. Thiagarajan, H. |
| Otsikko: | Dual algorithms for pure network problems. |
| Lehti: | Operations Research
1989 : JAN-FEB, VOL. 37:1, p. 159-171 |
| Asiasana: | NETWORKS ALGORITHMS LINEAR PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | The development of a new algorithmic implementation of the dual algorithm for capacitated minimum cost network flow problems is presented. Dual reoptimization procedures are introduced and primal and dual algorithms are compared for the optimization and reoptimization of network problems. The implementation makes use of cut-sets for efficient execution of the entering variable selection and the selection of the leaving variable is tied to the basis structure at an iteration. Computational testing with typical changes found in decomposition and relaxation procedures with transportation, assignment and transshipment problems indicates the dominance of dual reoptimization procedures. |
« edellinen | seuraava »
SCIMA