Table Of Content

DISCRETE APPLIED MATHEMATICS Discrete Applied Mathematics 112 (2001) 329 Author Index Volume 112 (2001) Baiou, M., On the dominant of the Steiner 2-edge connected subgraph polytope -: 3- 10 Biha, M.D., H. Kerivin and A.R. Mahjoub, Steiner trees and polyhedra -3) 101-120 Borndorfer, R. and R. Weismantel, Discrete relaxations of combinatorial programs -3 - 26 Cavalcante, C.C.B., C.C. de Souza, M.W.P. Savelsbergh, Y. Wang and L.A. Wolsey, Scheduling projects with labor constraints Confessore, G., P. Dell’Olmo and S. Giordani, An approximation result for a periodic allocation problem Crainic, T.G., A. Frangioni and B. Gendron, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design 72 Daneshmand, S.V., see T. Polzin 241-2 Daneshmand, S.V., see T. Polzin 263- Dell’Olmo, P., see G. Confessore de Souza, C.C., see C.C.B. Cavalcante Fiorini, S., Determining the automorphism group of the linear ordering polytope Frangioni, A., see T.G. Crainic Gendron, B., see T.G. Crainic Giordani, S., see G. Confessore Gouveia, L. and J.M. Pires, The asymmetric travelling salesman problem: on generaliz- ations of disaggregated Miller-Tucker—Zemlin constraints Hartmann, M. and O. Ozliik, Facets of the p-cycle polytope Hurink, J. and J. Keuchel, Local search algorithms for a single-machine scheduling problem: with positive and negative time-lags Hurink, J. and S. Knust, Makespan minimization for flow-shop problems with transpor- tation times and a single robot -3) 199-216 Jaumard, B., O. Marcotte, C. Meyer and T. Vovor, Comparison of column generation models for channel assignment in cellular networks 217-240 Kerivin, H., see M.D. Biha -3) 101-120 Keuchel, J., see J. Hurink -3) 179-197 Knust, S., see J. Hurink 3) 199-216 Labbe, M., Preface : l- | Mahjoub, A.R., see M.D. Biha -3) 101-120 Marcotte, O., see B. Jaumard -3) 217-240 Meyer, C., see B. Jaumard -3) 217-240 Morales, D., see H.E. Romeijn 3) 301-328 Ozliik, O., see M. Hartmann 3) 147-178 Pires, J.M., see L. Gouveia 3) 129-145 Polzin, T. and S.V. Daneshmand, A comparison of Steiner tree relaxations 3) 241-261 Polzin, T. and $.V. Daneshmand, Improved algorithms for the Steiner problem in networks 3) 263-300 Romeijn, H.E. and D. Morales, A probabilistic analysis of the multi-period single- sourcing problem —3) 301-328 Savelsbergh, M.W.P., see C.C.B. Cavalcante 3) 27- 52 Vovor, T., see B. Jaumard 3) 217-240 Wang, Y., see C.C.B. Cavalcante 3) 27- 52 Weismantel, R., see R. Borndorfer 3) I1- 26 Wolsey, L.A., see C.C.B. Cavalcante 3) 27- 52 PH: S0166-218X(01)00192-5