| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-bound algorithm for 0–1 parametric mixed integer programming
|
Ohtake, Yoshiaki
|
|
1985
|
4 |
1 |
p. 41-45
5 p.
|
artikel
|
| 2 |
A finitely converging cutting plane technique
|
Orlin, James B
|
|
1985
|
4 |
1 |
p. 1-3
3 p.
|
artikel
|
| 3 |
Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
|
Žilinskas, Antanas
|
|
1985
|
4 |
1 |
p. 35-39
5 p.
|
artikel
|
| 4 |
Careful usage of pessimistic values is needed in multiple objectives optimization
|
Weistroffer, H.R
|
|
1985
|
4 |
1 |
p. 23-25
3 p.
|
artikel
|
| 5 |
C-Programming: An outline
|
Sniedovich, Moshe
|
|
1985
|
4 |
1 |
p. 19-21
3 p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
1985
|
4 |
1 |
p. vi-
1 p.
|
artikel
|
| 7 |
Finding minimum dominating cycles in permutation graphs
|
Colbourn, Charles J
|
|
1985
|
4 |
1 |
p. 13-17
5 p.
|
artikel
|
| 8 |
On the complexity of decomposing matrices arising in satellite communication
|
Rendl, F
|
|
1985
|
4 |
1 |
p. 5-8
4 p.
|
artikel
|
| 9 |
On the convergence of curvilinear search algorithms in unconstrained optimization
|
Amaya, Jorge
|
|
1985
|
4 |
1 |
p. 31-34
4 p.
|
artikel
|
| 10 |
The bound improving sequence algorithm
|
Barcia, Paulo
|
|
1985
|
4 |
1 |
p. 27-30
4 p.
|
artikel
|
| 11 |
Worst-case analysis of a scheduling algorithm
|
Spinrad, Jeremy
|
|
1985
|
4 |
1 |
p. 9-11
3 p.
|
artikel
|
Tijdschrift beschrijving