nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A decomposition algorithm for multi-terminal networks flows
|
Shing, M.T |
|
1986 |
13 |
2-3 |
p. 165-181 17 p. |
artikel |
2 |
A linear algorithm for finding a minimum dominating set in a cactus
|
Hedetniemi, S.T |
|
1986 |
13 |
2-3 |
p. 287-292 6 p. |
artikel |
3 |
Allowable processing orders in the accelerated cascade algorithm
|
Goldman, A.J |
|
1986 |
13 |
2-3 |
p. 213-221 9 p. |
artikel |
4 |
A new variant of the partitioning shortest path algorithm
|
Phillips, Nancy V. |
|
1986 |
13 |
2-3 |
p. 207-212 6 p. |
artikel |
5 |
Author index Volume 13 (1986)
|
|
|
1986 |
13 |
2-3 |
p. 293-294 2 p. |
artikel |
6 |
A variable-dimension homotopy on networks for computing linear spatial equilibria
|
Jones, Philip C. |
|
1986 |
13 |
2-3 |
p. 131-156 26 p. |
artikel |
7 |
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
|
Ikura, Yoshiro |
|
1986 |
13 |
2-3 |
p. 239-248 10 p. |
artikel |
8 |
Degeneracy in transportation problems
|
Hung, M.S. |
|
1986 |
13 |
2-3 |
p. 223-237 15 p. |
artikel |
9 |
Microcomputer-based algorithms for large scale shortest path problems
|
Klingman, Darwin D. |
|
1986 |
13 |
2-3 |
p. 183-206 24 p. |
artikel |
10 |
Multi-terminal maximum flows in node-capacitated networks
|
Granot, Frieda |
|
1986 |
13 |
2-3 |
p. 157-163 7 p. |
artikel |
11 |
Précis
|
|
|
1986 |
13 |
2-3 |
p. 107-108 2 p. |
artikel |
12 |
Spatial market equilibrium problems as network models
|
Barros, Oscar |
|
1986 |
13 |
2-3 |
p. 109-130 22 p. |
artikel |
13 |
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
|
Iqbal Ali, A |
|
1986 |
13 |
2-3 |
p. 259-276 18 p. |
artikel |
14 |
The family constrained network problem
|
Mote, John |
|
1986 |
13 |
2-3 |
p. 249-257 9 p. |
artikel |
15 |
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
|
Glover, Fred |
|
1986 |
13 |
2-3 |
p. 277-286 10 p. |
artikel |