References
Edmonds J (1965) Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards B 69: 125–130
Edmonds J, Johnson EL (1973) Matching, Euler tours and the Chinese postman. Mathematical Programming 5: 88–124
Grötschel M, Jünger M, Reinelt G (1989) Via minimization with pin preassignments and layer preferal: A computational study. Zeitschrift für Angewandte Mathematik und Mechanik 69: 393–399
Asano T, Edahiro M, Imai H, Iri M (1985) Practical use of bucketing techniques in Computational Geometry. In: GT Toussaint (ed.) Computational Geometry. Elsevier Science Publishers BV North-Holland, Amsterdam: 153–195
Korte B (1989) Applications of Combinatorial Optimization. In: M Iri, K Tanabe (eds.) Mathematical Programming: Recent Developments and Applications. Kluwer Academic Publishers, Dordrecht: 203–225.
Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys D (1985) The Traveling Salesman Problem. Wiley, Chichester
Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization. Wiley, New York
Reinelt G (1989) Fast heuristics for large geometric travelling salesman problems, Report No. 185, Schwerpunktprogramm der Deutschen Forschungsgemeinschaft. Universität Augsburg, Augsburg
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Grötschel, M., Jünger, M. & Reinelt, G. Optimal control of plotting and drilling machines: A case study. ZOR - Methods and Models of Operations Research 35, 61–84 (1991). https://doi.org/10.1007/BF01415960
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01415960