nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterisation of all feasible solutions to an integer program
|
Williams, H.P. |
|
1983 |
5 |
1 |
p. 147-155 9 p. |
artikel |
2 |
A mathematical programming model for the long term development of an off-shore gas field
|
Beale, E.M.L. |
|
1983 |
5 |
1 |
p. 1-9 9 p. |
artikel |
3 |
An algorithm for single machine sequencing with release dates to minimize total weighted completion time
|
Hariri, A.M.A. |
|
1983 |
5 |
1 |
p. 99-109 11 p. |
artikel |
4 |
Design of electricity supply networks
|
Boffey, T.B. |
|
1983 |
5 |
1 |
p. 25-38 14 p. |
artikel |
5 |
Editorial board
|
|
|
1983 |
5 |
1 |
p. IFC- 1 p. |
artikel |
6 |
Lower bounds for the clique and the chromatic numbers of a graph
|
Edwards, C.S. |
|
1983 |
5 |
1 |
p. 51-64 14 p. |
artikel |
7 |
NP-completeness of a family of graph-colouring problems
|
Irving, Robert W. |
|
1983 |
5 |
1 |
p. 111-117 7 p. |
artikel |
8 |
On the chromatic forcing number of a random graph
|
McDiarmid, Colin |
|
1983 |
5 |
1 |
p. 123-132 10 p. |
artikel |
9 |
On the complexity of finding multi-constrained spanning trees
|
Camerini, P.M. |
|
1983 |
5 |
1 |
p. 39-50 12 p. |
artikel |
10 |
On the computational complexity of a merge recognition problem
|
Mansfield, Anthony |
|
1983 |
5 |
1 |
p. 119-122 4 p. |
artikel |
11 |
On the quadratic assignment problem
|
Frieze, A.M. |
|
1983 |
5 |
1 |
p. 89-98 10 p. |
artikel |
12 |
Preface
|
Wilson, L.B. |
|
1983 |
5 |
1 |
p. v- 1 p. |
artikel |
13 |
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
|
Franco, John |
|
1983 |
5 |
1 |
p. 77-87 11 p. |
artikel |
14 |
Randomised algorithms
|
Welsh, D.J.A. |
|
1983 |
5 |
1 |
p. 133-145 13 p. |
artikel |
15 |
Scheduling subject to resource constraints: classification and complexity
|
Blazewicz, J. |
|
1983 |
5 |
1 |
p. 11-24 14 p. |
artikel |
16 |
Surrogate duality relaxation for job shop scheduling
|
Fisher, M.L. |
|
1983 |
5 |
1 |
p. 65-75 11 p. |
artikel |