Journals in DBLP
Networks 1998, volume: 31, number: 4
Dong X. Shaw , Geon Cho The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:205-216 [Journal ] D. Gross , J. T. Saccoman Uniformly optimally reliable graphs. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:217-225 [Journal ] Philippe Mahey , Adam Ouorou , Larry LeBlanc , Jerome Chifflet A new proximal decomposition algorithm for routing in telecommunication networks. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:227-238 [Journal ] Dominique Barth , Petrisor Panaite Undirected graphs rearrangeable by 2-length walks. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:239-247 [Journal ] Danny Z. Chen , D. T. Lee , R. Sridhar , Chandra N. Sekharan Solving the all-pair shortest path query problem on interval and circular-arc graphs. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:249-258 [Journal ] Hanif D. Sherali , Kaan Ozbay , Shivaram Subramanian The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:259-272 [Journal ] Uwe H. Suhl , Heinrich Hilbert A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:273-282 [Journal ] Magnús M. Halldórsson , Shuichi Ueno , Hiroshi Nakao , Yoji Kajitani Approximating Steiner trees in graphs with restricted weights. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:283-292 [Journal ] Darko Skorin-Kapov Hub network games. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:4, pp:293-302 [Journal ]