default search action
Networks, Volume 29
Volume 29, Number 1, January 1997
- Matteo Fischetti, Daniele Vigo:
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. 55-67
Volume 29, Number 2, March 1997
- Akiyoshi Shioura, Maiko Shigeno:
The tree center problems and the relationship with the bottleneck knapsack problems. 107-110 - Stefano Pallottino, Maria Grazia Scutellà:
Dual algorithms for the shortest path tree problem. 125-133
Volume 29, Number 3, May 1997
- Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner:
Minimum-weight cycles in 3-separable graphs. 151-160 - Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman:
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. 161-171
Volume 29, Number 4, July 1997
- De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi:
Reliability analysis of replicated and-or graphs. 195-203 - Shimon Even, Ami Litman:
Layered cross product - A technique to construct interconnection networks. 219-223 - Shin-Yeu Lin, Ch'i-Hsin Lin:
A computationally efficient method for nonlinear multicommodity network flow problems. 225-244 - Takao Asano:
Constructing a bipartite graph of maximum connectivity with prescribed degrees. 245-263
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2015-02-28 01:40 CET by the dblp team