An algorithm for which it can be shown that the number of steps required to find a solution to a problem is an exponential function of the problem's data. The simplex algorithm is an exponential-bounded algorithm, although its use in practice belies that designation. Polynomially-bounded algorithm; Simplex method.
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Exponential-bounded (-time) algorithm. In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_316
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_316
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive