| 0 | -- | 0 | L. B. Wilson, C. S. Edwards, Victor J. Rayward-Smith. Preface |
| 1 | -- | 9 | E. M. L. Beale. A mathematical programming model for the long term development of an off-shore gas field |
| 11 | -- | 24 | Jacek Blazewicz, Jan Karel Lenstra, A. H. G. Rinnooy Kan. Scheduling subject to resource constraints: classification and complexity |
| 25 | -- | 38 | T. B. Boffey, J. R. Green. Design of electricity supply networks |
| 39 | -- | 50 | Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli. On the complexity of finding multi-constrained spanning trees |
| 51 | -- | 64 | C. S. Edwards, C. H. Elphick. Lower bounds for the clique and the chromatic numbers of a graph |
| 65 | -- | 75 | M. L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan. Surrogate duality relaxation for job shop scheduling |
| 77 | -- | 87 | John Franco, Marvin C. Paull. Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem |
| 89 | -- | 98 | Alan M. Frieze, J. Yadegar. On the quadratic assignment problem |
| 99 | -- | 109 | A. M. A. Hariri, Chris N. Potts. An algorithm for single machine sequencing with release dates to minimize total weighted completion time |
| 111 | -- | 117 | Robert W. Irving. NP-completeness of a family of graph-colouring problems |
| 119 | -- | 122 | Anthony Mansfield. On the computational complexity of a merge recognition problem |
| 123 | -- | 132 | Colin McDiarmid. On the chromatic forcing number of a random graph |
| 133 | -- | 145 | D. J. A. Welsh. Randomised algorithms |
| 147 | -- | 155 | H. P. Williams. A characterisation of all feasible solutions to an integer program |