Abstract
An optimization problem P is to find a best possible “structure” subject to several input-parameters which are described and whose values are left unspecified. If all these parameters are set to certain values we speak of an instance I of the problem P. In the above general not very illustrative definition we have carefully distinguished between a problem and an instance of a problem. Informally, a problem is a collection of similar instances.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Derigs, U. (1988). Combinatorial Optimization. In: Programming in Networks and Graphs. Lecture Notes in Economics and Mathematical Systems, vol 300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51713-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-51713-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18969-5
Online ISBN: 978-3-642-51713-6
eBook Packages: Springer Book Archive