Preview
Unable to display preview. Download preview PDF.
6. References
Edmonds, J. and Johnson, E. "Matching, Euler tours and the Chinese Postman", Math. Prog. 5, 1973, p. 88–124.
Frederickson, G. N. "Approximation Algorithms for some Postman Problems", Journal of A.C.M., vol.26, 1979, p. 538–554.
Geoffrion, A. "Lagrangean Relaxation for Integer Programming", Math. Prog. Study 2, 1974, p. 82–114.
Kappauf, C. H. and Koehler, G. J. "The Mixed Postman Problem", Discrete App. Math. 1, 1979, p. 89–103.
Minieka, E. "Optimization Algorithms for Networks and Graphs". Ed. Marcel Dekker, New York, 1978.
Minieka, E. "The Chinese Postman Problem for Mixed Networks", Manag. Science, vol.25, 1979, p. 643–648.
Papadimitriou, C. "On the Complexity of Edge Traversing", Journal of A.C.M., vol. 23, 1976, p. 544–554.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Christofides, N., Benavent, E., Campos, V., Corberán, A., Mota, E. (1984). An optimal method for the mixed postman problem. In: Thoft-Christensen, P. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008937
Download citation
DOI: https://doi.org/10.1007/BFb0008937
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13185-4
Online ISBN: 978-3-540-38828-9
eBook Packages: Springer Book Archive