| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A decomposition method for minimizing quadratic pseudo-Boolean functions
|
Billionnet, Alain
|
|
1989
|
8 |
3 |
p. 161-163
3 p.
|
artikel
|
| 2 |
A simple complexity proof for a polynomial-time linear programming algorithm
|
Tseng, Paul
|
|
1989
|
8 |
3 |
p. 155-159
5 p.
|
artikel
|
| 3 |
Capacity allocation in generalized Jackson networks
|
Wein, Lawrence M.
|
|
1989
|
8 |
3 |
p. 143-146
4 p.
|
artikel
|
| 4 |
Cost of sequential connection for points in space
|
Steele, J.Michael
|
|
1989
|
8 |
3 |
p. 137-142
6 p.
|
artikel
|
| 5 |
Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
|
Bland, Robert G
|
|
1989
|
8 |
3 |
p. 125-128
4 p.
|
artikel
|
| 6 |
Linear programming brings marital bliss
|
Vande Vate, John H.
|
|
1989
|
8 |
3 |
p. 147-153
7 p.
|
artikel
|
| 7 |
Probing through the intersection of hyperplanes
|
Sethi, Awanti P
|
|
1989
|
8 |
3 |
p. 165-170
6 p.
|
artikel
|
| 8 |
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
|
Miller, D.L.
|
|
1989
|
8 |
3 |
p. 129-135
7 p.
|
artikel
|
| 9 |
Submodularity and valid inequalities in capacitated fixed charge networks
|
Wolsey, Laurence A.
|
|
1989
|
8 |
3 |
p. 119-124
6 p.
|
artikel
|
| 10 |
Worst-case analysis of an approximation algorithm for flow-shop scheduling
|
Nowicki, Eugeniusz
|
|
1989
|
8 |
3 |
p. 171-177
7 p.
|
artikel
|
Tijdschrift beschrijving