Abstract
It is clear that there is no difficulty in solving virtually any combinatorial optimization problem in principle. None of the questions of insolvability, which are the central focus of recursive function theory, are an issue. If we wish to solve any given problem, all we need to do, in principle, is to make a list of all possible feasible solution, evaluate the cost of each one, and choose the best. This “solves” the problem at hand.
This work has been supported by the U.S. Air Force Office of Scientific Research Grant 71-2076.
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.
References
R.V. Book, “On Languages Accepted in Polynomial Time,” SIAM J. Comput., 1 (1972) 281–287.
S.A. Cook, “The Complexity of Theorem Proving Procedures,” Proc. Third ACM Symposium on Theory of Computing, (1971) 151–158.
S.A. Cook, “A Hierarchy of Nondeterministic Time Complexity,” Proc. Fourth ACM Symposium on Theory of Computing, (1972) 187–192.
K. Eswaran and R. Tarjan, “Minimal Augmentation of Graphs,” to appear in SIAM J. Comput.
R.M. Karp “Reducibility among Combinatorial Problems,” Proc, IBM Symposium on Complexity of Computer Computations, Plenum Press, N.Y., 1973.
E.L. Lawler, “An Introduction to Matroid Optimization,” this volume.
D. Matula, private communication, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 CISM, Udine
About this chapter
Cite this chapter
Lawler, E.L. (1975). Complexity of Combinatorial Computations. In: Rinaldi, S. (eds) Topics in Combinatorial Optimization. CISM International Centre for Mechanical Sciences, vol 175. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3291-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-7091-3291-3_5
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81339-3
Online ISBN: 978-3-7091-3291-3
eBook Packages: Springer Book Archive