Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 65 (1996) 441-442 Author Index Volume 65 (1996) Arikati, S.R. and U.N. Peled, A polynomial algorithm for the parity path problem on perfectly orientable graphs Avis, D. and K. Fukuda, Reverse search for enumeration Bachem, A., W. Hochstattler and M. Malich, The simulated trading heuristifco r solving vehicle routing problems Berge, C.,S ome properties of non-bicolorable hypergraphs and the four-color problem Blazewicz, J.. M. Drozdowski, D. de Werra and J. Weglarz, Deadline scheduling of multiprocessor tasks Brucker, P., J. Hurink and F. Werner, Improving local search heuristics for some scheduling problems—I Burkard, R.E., R. Rudolf and G.J. Woeginger, Three-dimensional axial assignment problems with decomposable cost coefficients Carlier, J. and C. Lucet, A decomposition algorithm for network reliability evaluation Cochand, M. and A. Gaillard, On preemptive scheduling: a general setting for the two-phase method Dai, Y., H. Imai, K. lwano, N. Katoh, K. Ohtsuka and N. Yoshimura, A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms Dell’ Amico, M. and F. Maffioli, On some multicriteria arborescence problems: com plexity and algorithms de Werra, D., see J. Blazewicz Drozdowski, M., see J. Blazewicz, Euler, R. and H. Le Verge, Time-tables, polyhedra and the greedy algorithm Fukuda, K., see D. Avis Gaillard, A., see M. Cochand Glover, F., Ejection chains, reference structures and alternating path methods for traveling salesman problems Hammer, P.L. and A.K. Kelmans, Laplacian spectra and spanning trees of threshold graphs Hansen, P. and M. Zheng, Shortest shortest path trees of a network Hertz, A., Y. Mottet, and Y. Rochat, On a scheduling problem in a robotized analytical system Hertz, A. and M. Widmer, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints Hilton, A.J.W., J.P. Liu and C. Zhao, Graphs that admit 3-to-1 or 2-to-1 maps onto the circle Elsevier Science B.V 442 Discrete Applied Mathematics 65 (1996) 441-442 Hoang, C.T., A note on perfectly orderable graphs Hochstattler, W., see A. Bachem Hurink, J., see P. Brucker Imai, H., see Y. Dai Iwano. K., see Y. Dai Katoh, N.. see Y. Dai Kelmans, A.K., see P.L. Hammer Lehel, J.. F. Maffray and M. Preissmann, Graphs with largest number of minimum cuts I e Verge H . see R. uler Liu, J.P., see A.J.W. Hilton Lucet, C., see J. Carlier Maffioli, F.. see M. Dell’ Amico Maffray, F., see J. Lehel Malich, M., see A. Bachem Mottet, Y., see A. Hertz Ohtsuka, K., see Y. Dai Pattloch, M. and G. Schmidt, Lot-size scheduling of two types of jobs on identical machines Peled, U.N., see S.R. Arikati Preissmann, M., see J. Lehel Rochat, Y., see A. Hertz Rudolf, R., see R.E. Burkard Schmidt, G., see M. Pattloch Shum, H. and L.E. Trotter Jr, Cardinality-restricted chains and antichains in partially ordered sets Trotter, L.E., see H. Shum Weglarz, J., see J. Blazewicz Werner, F., see P. Brucker Widmer, M., see A. Hertz Woeginger, G.J., see R.E. Burkard Yoshimura, N., see Y. Dai Zhao, C., see A.J.W. Hilton Zheng, M., see P. Hansen