nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A heuristic approach to hard constrained shortest path problems
|
Ribeiro, Celso C. |
|
1985 |
10 |
2 |
p. 125-137 13 p. |
artikel |
2 |
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
|
Potts, C.N. |
|
1985 |
10 |
2 |
p. 155-164 10 p. |
artikel |
3 |
A note on matchings and separability
|
Cook, W. |
|
1985 |
10 |
2 |
p. 203-209 7 p. |
artikel |
4 |
A successful algorithm for the undirected Hamiltonian path problem
|
Thompson, Gerald L. |
|
1985 |
10 |
2 |
p. 179-195 17 p. |
artikel |
5 |
First fit decreasing scheduling on uniform multiprocessors
|
Kunde, Manfred |
|
1985 |
10 |
2 |
p. 165-177 13 p. |
artikel |
6 |
Minimum cost flow algorithms for series-parallel networks
|
Bein, Wolfgang W. |
|
1985 |
10 |
2 |
p. 117-124 8 p. |
artikel |
7 |
On some conditioning results in the probabilistic analysis of algorithms
|
McDiarmid, Colin |
|
1985 |
10 |
2 |
p. 197-201 5 p. |
artikel |
8 |
On the complexity of partitioning graphs into connected subgraphs
|
Dyer, M.E. |
|
1985 |
10 |
2 |
p. 139-153 15 p. |
artikel |
9 |
Preface
|
Rinnooy Kan, A.H.G. |
|
1985 |
10 |
2 |
p. 115- 1 p. |
artikel |