Document Zbl 0416.90048

The mixed postman problem. (English) Zbl 0416.90048

Discrete Appl. Math. 1, 89-103 (1979).

Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0416.90048

MSC:

90C10	Integer programming
90C35	Programming involving graphs or networks
05C35	Extremal problems in graph theory
05C45	Eulerian and Hamiltonian graphs

Keywords:

integer programming; shortest length tour; connected network; directed chinese postman problem; mixed network; mixed postman problem; prime assigned Euler network

Cite Review PDF

Full Text: DOI

References:

[1]	Andrew, G.; Hoffman, T.; Krabeck, C., On the generalized set covering problem (1968), Control Data Corporation
[2]	Beltrami, E. J.; Bodin, L. D., Networks and vehicle routing for municipal waste collection, Networks, 4, 65-94 (1974) · Zbl 0284.90032
[3]	Benders, J. F., Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematick, 4, 238-252 (1962) · Zbl 0109.38302
[4]	Dantzig, G. B.; Van Slyke, R. M., Generalized upper bounding techniques, J. Computer Sys. Sci, 1, 213-226 (1967) · Zbl 0162.23003
[5]	Edmonds; Johnson, E. L., Matching, Euler Tours and the Chinese Postman, Math. Programming, 5, 88-124 (1973) · Zbl 0281.90073
[6]	Ford, L. R.; Fulkerson, D. R., Flows in Networks (1962), Princeton University Press: Princeton University Press Princeton, NJ · Zbl 0139.13701
[7]	Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064
[8]	Kappauf, C. H., The postman problem, (Ph. D. Dissertation (1975), Northwestern University: Northwestern University Evanston, ILL) · Zbl 0416.90048
[9]	Lemke, C. E.; Salkin, H. M.; Spielberg, K., Set covering by single branch enumeration with linear programming sub-problems, Operations Res., 19, 988-1022 (1971) · Zbl 0232.90033
[10]	Marshall, C. W., Applied Graph Theory (1971), Wiley Interscience: Wiley Interscience New York · Zbl 0226.05101
[11]	Murty, K. G., The symmetric assignment problem, (ORC 67-12 (1967), Operations Research Center, University of California: Operations Research Center, University of California Berkeley) · Zbl 0275.90024
[12]	Orloff, C. S., A fundamental problem in vehicle routing, Networks, 4, 35-64 (1974) · Zbl 0368.90130
[13]	Papadimitriou, C. H., On the complexity of edge-traversing, J.C.M., 23, 3, 544-554 (1976) · Zbl 0351.90079

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.