Abstract
Let us start with two examples. A company has a machine which drills holes into printed circuit boards. Since it produces many of these boards it wants the machine to complete one board as fast as possible. We cannot optimize the drilling time but we can try to minimize the time the machine needs to move from one point to another. Usually drilling machines can move in two directions: the table moves horizontally while the drilling arm moves vertically. Since both movements can be done simultaneously, the time needed to adjust the machine from one position to another is proportional to the maximum of the horizontal and the vertical distance. This is often called the ℓ ∞ -distance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
General Literature
Cormen , T.H., Leiserson , C.E., Rivest , R.L., and Stein , C. [2009]: Introduction to Algorithms. Third Edition. MIT Press, Cambridge 2009
Hougardy , S., and Vygen , J. [2016]: Algorithmic Mathematics. Springer, Cham 2016
Knuth , D.E. [1968]: The Art of Computer Programming; Vol. 1. Fundamental Algorithms. Addison-Wesley, Reading 1968 (third edition: 1997)
Mehlhorn , K., and Sanders , P. [2008]: Algorithms and Data Structures: The Basic Toolbox. Springer, Berlin 2008
Cited References
Aho , A.V., Hopcroft , J.E., and Ullman , J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974
Cobham , A. [1964]: The intrinsic computational difficulty of functions. Proceedings of the 1964 Congress for Logic Methodology and Philosophy of Science (Y. Bar-Hillel , ed.), North-Holland, Amsterdam 1964, pp. 24–30
Edmonds , J. [1965]: Paths, trees, and flowers. Canadian Journal of Mathematics 17 (1965), 449–467
Garey , M.R., Graham , R.L., and Johnson , D.S. [1976]: Some NP-complete geometric problems. Proceedings of the 8th Annual ACM Symposium on the Theory of Computing (1976), 10–22
Han , Y. [2004]: Deterministic sorting in O(nloglogn) time and linear space. Journal of Algorithms 50 (2004), 96–105
Stirling , J. [1730]: Methodus Differentialis. London 1730
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer-Verlag GmbH Germany
About this chapter
Cite this chapter
Korte, B., Vygen, J. (2018). Introduction. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-56039-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-56039-6_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-56038-9
Online ISBN: 978-3-662-56039-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)