export record
dblp key:
journals/networks/Pallottino84 share record
persistent URL:
Stefano Pallottino : Shortest-path methods: Complexity, interrelations and new propositions. Networks 14 (2 ) : 257-267 (1984 )export record
dblp key:
journals/networks/PangY84 share record
persistent URL:
Jong-Shi Pang , Chang-Sung Yu : A special spatial equilibrium problem. Networks 14 (1 ) : 75-81 (1984 )export record
dblp key:
journals/networks/PangY84a share record
persistent URL:
Jong-Shi Pang , Chang-Sung Yu : Linearized simplicial decomposition methods for computing traffic equilibria on networks. Networks 14 (3 ) : 427-438 (1984 )export record
dblp key:
journals/networks/Psaraftis84 share record
persistent URL:
Harilaos N. Psaraftis : On the practical importance of asymptotic optimality in certain heuristic algorithms. Networks 14 (4 ) : 587-596 (1984 )export record
dblp key:
journals/networks/QueyranneQ84 share record
persistent URL:
Maurice Queyranne : Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95. Networks 14 (1 ) : 174-175 (1984 )export record
dblp key:
journals/networks/RonenP84 share record
persistent URL:
D. Ronen , Yehoshua Perl : Heuristics for finding a maximum number of disjoint bounded paths. Networks 14 (4 ) : 531-544 (1984 )export record
dblp key:
journals/networks/Schumacher84 share record
persistent URL:
Ulrich Schumacher : An algorithm for construction of a k -connected graph with minimum number of edges and quasiminimal diameter. Networks 14 (1 ) : 63-74 (1984 )export record
dblp key:
journals/networks/Smith84 share record
persistent URL:
Derek Smith : Graphs with the smallest number of minimum cut sets. Networks 14 (1 ) : 47-61 (1984 )export record
dblp key:
journals/networks/SpaccamelaKS84 share record
persistent URL:
Alberto Marchetti-Spaccamela , A. H. G. Rinnooy Kan , Leen Stougie : Hierarchical vehicle routing problems. Networks 14 (4 ) : 571-586 (1984 )export record
dblp key:
journals/networks/Steiner84 share record
persistent URL:
George Steiner : Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50. Networks 14 (1 ) : 177-178 (1984 )export record
dblp key:
journals/networks/Storer84 share record
persistent URL:
James A. Storer : On minimal-node-cost planar embeddings. Networks 14 (2 ) : 181-212 (1984 )export record
dblp key:
journals/networks/SuurballeT84 share record
persistent URL:
J. W. Suurballe , Robert Endre Tarjan : A quick method for finding shortest pairs of disjoint paths. Networks 14 (2 ) : 325-336 (1984 )export record
dblp key:
journals/networks/Syslo84 share record
persistent URL:
Maciej M. Syslo : On the computational complexity of the minimum-dummy-activities problem in a pert network. Networks 14 (1 ) : 37-45 (1984 )export record
dblp key:
journals/networks/Whitt84 share record
persistent URL:
Ward Whitt : The amount of overtaking in a network of queues. Networks 14 (3 ) : 411-426 (1984 )