Contents
We start this chapter by recalling the formulation of a deterministic combinatorial optimization problem, that is the one in which all the input parameters are precisely known. We also present some well known, special cases of this problem like minimum spanning tree, minimum selecting items, shortest path, minimum assignment and minimum cut. We introduce then the minmax regret combinatorial optimization problem with interval data, which can be viewed as a generalization of the deterministic problem where the imprecision is taken into account.We also discuss some closely related problems. In particular we consider some other robustness criteria which can be applied to the interval uncertainty representation.
This is a preview of subscription content, log in via an institution to check access.
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
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kasperski, A. (2008). Problem Formulation. In: Discrete Optimization with Interval Data. Studies in Fuzziness and Soft Computing, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78484-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-78484-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78483-8
Online ISBN: 978-3-540-78484-5
eBook Packages: EngineeringEngineering (R0)