Advertisement

Constrained Periodic Optimization of Finite Automata

  • Arturo Locatelli
  • Piero Migliarese
  • Sergio Rinaldi
Part of the International Centre for Mechanical Sciences book series (CISM, volume 135)

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.

Keywords

Minimum Span Tree Travelling Salesman Problem Finite Automaton Constraint Rate Optimal Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. BELLMORE, G.L. NEMHAUSER, “The travelling Salesman Problem: a Survey” Operations Research, Vol 16, pp. 538–558, 1968.MathSciNetCrossRefMATHGoogle Scholar
  2. [2]
    M. HELD, R.M. KARP, ‘The Travelling Salesman Problem and Minimum Spanning Trees“, Part I Operations Research, Vol. 18, pp. 1138–1162, 1970.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    M. HELD, R.M. KARP, “The Travelling Salesman Problem and Minimum Spanning Trees” Part II Mathematical Programming, vol. 1, pp. 6–25 1971.MathSciNetCrossRefMATHGoogle Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    E.L. LAWLER, “ Optimal Cycles in Doubly Weighted Direct ed Linear Graphs” Theorie des Graphes, Int. Symp. Roma, Italy, July 1966, Dunou, Faris.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    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).Google Scholar
  8. [8]
    B. FOX, “ Finding Minimal Cost-Time Ratio Circuits” Operations Research, vol. 17, N.3, PP. 564550, May-June 1969.Google Scholar
  9. [9]
    R. REITER, “Scheduling Parallel Computations”, J. of ACM, vol. 15, N.4, PP. 590–599, Oct. 1968.Google Scholar
  10. [10]
    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).Google Scholar

Copyright information

© Springer-Verlag Wien 1972

Authors and Affiliations

  • Arturo Locatelli
  • Piero Migliarese
  • Sergio Rinaldi
    • 1
  1. 1.Istituto di Elettrotecnica ed ElettronicaPolitecnico di MilanoMilanoItaly

Personalised recommendations