| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
|
Hwang, F.K.
|
|
1989
|
8 |
2 |
p. 85-87
3 p.
|
artikel
|
| 2 |
An aspiration-level interactive method (AIM) for decision making
|
Lotfi, Vahid
|
|
1989
|
8 |
2 |
p. 113-115
3 p.
|
artikel
|
| 3 |
An edge elimination test for the steiner problem in graphs
|
Duin, C.W.
|
|
1989
|
8 |
2 |
p. 79-83
5 p.
|
artikel
|
| 4 |
A note on the traveling salesman problem
|
Chvátal, V.
|
|
1989
|
8 |
2 |
p. 77-78
2 p.
|
artikel
|
| 5 |
A probabilistic heuristic for a computationally difficult set covering problem
|
Feo, Thomas A
|
|
1989
|
8 |
2 |
p. 67-71
5 p.
|
artikel
|
| 6 |
A sequential dual simplex algorithm for the linear assignment problem
|
Akgül, Mustafa
|
|
1989
|
8 |
2 |
p. 117-
1 p.
|
artikel
|
| 7 |
Bounding the expected time-cost curve for a stochastic pert network from below
|
Wallace, Stein W.
|
|
1989
|
8 |
2 |
p. 89-94
6 p.
|
artikel
|
| 8 |
Capital gains taxation and the lock-in effect: A probabilistic framework
|
Zuckerman, Dror
|
|
1989
|
8 |
2 |
p. 101-106
6 p.
|
artikel
|
| 9 |
Computational complexity of uncapacitated multi-echelon production planning problems
|
Arkin, Esther
|
|
1989
|
8 |
2 |
p. 61-66
6 p.
|
artikel
|
| 10 |
Finding the most vital arcs in a network
|
Ball, Michael O.
|
|
1989
|
8 |
2 |
p. 73-76
4 p.
|
artikel
|
| 11 |
Linear utility theory for belief functions
|
Jaffray, Jean-Yves
|
|
1989
|
8 |
2 |
p. 107-112
6 p.
|
artikel
|
| 12 |
The linear multiple choice knapsack problem
|
Sarin, Sanjiv
|
|
1989
|
8 |
2 |
p. 95-100
6 p.
|
artikel
|
Tijdschrift beschrijving