Abstract
The nature of a combinatorial optimization Problem (COP) is accounted for. To substantiate the significance of such Problems to decision-making in practice, we then list the most profitable application areas as well as the most applicable Problem types. Past history is briefly reviewed within the framework of an annotated bibliography. The closing section discusses today’s challenges and what we believe will be tomorrow’s main issues of concern.
The paper is based on a plenary address, “Tutorial on Combinatorial Optimization”, delivered at DGOR Jahrestagung 1985, Hamburg, September 1985. At the oral presentation r however, the tutorial aspects were emphasized in the sense that, for example, all models discussed were appropriately defined and illustrated. As all such technical matters are well-documented in the literature, we have here endeavoured to focus mainly upon the present and the prospected future.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clausen, J., Krarup, J. (1986). Combinatorial Optimization: Challenges and Trends. In: Streitferdt, L., Hauptmann, H., Marusev, A.W., Ohse, D., Pape, U. (eds) DGOR. Operations Research Proceedings 1985, vol 1985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71161-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-71161-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-71162-6
Online ISBN: 978-3-642-71161-9
eBook Packages: Springer Book Archive