Abstract
The problem of Periodic Optimization of finite autornata is here considered with reference to the case where either “path constraints” or “integral constraints” are present. Algorithms are presented for both problems and structural properties of their solutions are discussed. The theory here developped is shown to fit with significant applications.
Supported by Centro di Teoria dei Sistemi (CNR)
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
M. BELLMORE, G.L. NEMHAUSER, “The travelling Salesman Problem: a Survey” Operations Research, Vol 16, pp. 538–558, 1968.
M. HELD, R.M. KARP, ‘The Travelling Salesman Problem and Minimum Spanning Trees“, Part I Operations Research, Vol. 18, pp. 1138–1162, 1970.
M. HELD, R.M. KARP, “The Travelling Salesman Problem and Minimum Spanning Trees” Part II Mathematical Programming, vol. 1, pp. 6–25 1971.
L. FRATTA, F. MAFFIOLI, ‘On Heuristically Guided Algorithm for the Travelling Salesman Problem“ Proceedings of the Int. Congr. of Cybernetics and Systems, August 28-September 3, 1972, Oxford, U.K.
E.L. LAWLER, “ Optimal Cycles in Doubly Weighted Direct ed Linear Graphs” Theorie des Graphes, Int. Symp. Roma, Italy, July 1966, Dunou, Faris.
G.B. DANTZIG, W.O. BLATTNER and M.R. RAO, “ Finding a Cycle in a Graph with Minimum Cost to Time Ratio with Application to a Ship Routing Problem’’, Theorie des Graphes Int. Symp. Roma Italy, July 1966, Dunod, Paris.
I.V. ROMANOVSKII, “ Optimization of Stationary Control of a Discrete Deterministic Process” Kibernetika, Vol. 3, N.2, pp. 66–78, March-April 1967. ( American translation in Cybernetics).
B. FOX, “ Finding Minimal Cost-Time Ratio Circuits” Operations Research, vol. 17, N.3, PP. 564550, May-June 1969.
R. REITER, “Scheduling Parallel Computations”, J. of ACM, vol. 15, N.4, PP. 590–599, Oct. 1968.
P. MIGLIARESE, P. PALERMO, C. ROVEDA, “A Problem of Sequencing for Artificial Fibres Industries”, Ricerca Operativa, vol.1, N.1, pp. 37–40, Jan. 1971 (in Italian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Springer-Verlag Wien
About this chapter
Cite this chapter
Locatelli, A., Migliarese, P., Rinaldi, S. (1972). Constrained Periodic Optimization of Finite Automata. In: Marzollo, A. (eds) Periodic Optimization. International Centre for Mechanical Sciences, vol 135. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2652-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2652-3_4
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81135-1
Online ISBN: 978-3-7091-2652-3
eBook Packages: Springer Book Archive