Optimal Unconstrained Cycles in Graphs

  • S. Rinaldi
Part of the CISM International Centre for Mechanical Sciences book series (CISM, volume 175)


his chapter is devoted to the problem of finding optimal cycles in graphs.


Linear Programming Problem Average Cost Binary Search Deterministic Case 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    I.V. Romanovskii, “Optimization of Stationary Control of a Discrete Deterministic Process” Kibernetica, vol. 3, n.2, pp. 66–78, March-April 1967 ( American translation in “Cybernetics”).Google Scholar
  2. [2]
    I.L. Traiger and A. Gill, “On an Asymptotic Optimization Problem in Finite, Directed, Weighted Graphs” Information and Control, vol. 13, n. 6, pp. 527–533, Dec. 1968.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    S. Rinaldi, “Asymptotic Properties of the Cost Functions Associated to Any Infinite Path in a Finite Graph” 11th Int. Autom. and Instrum. Conf., Milano (Italy), Nov. 1970, published by Mondadori, Milano, Italy.Google Scholar
  4. [4]
    R. Howard, “Dynamic Programming and Markov Processes” Technology Press and Wiley, 1960.Google Scholar
  5. [5]
    R. Howard, “Dynamic Probabilistic Models” Volume II, John Wiley and Sons, 1971.Google Scholar
  6. [6]
    A. Fillieres, “Cycles with Minimum Average Length” Report n.67–21 of the Operations Research Center, University of California, Berkeley, June 1967.Google Scholar
  7. [7]
    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” Theory of Graphs, Int. Symp., Roma, Italy, July 1966, published by Dunod, Paris and Gordon and Breach, N.Y., pp. 77–83.Google Scholar
  8. [8]
    E. L. Lawler, “Optimal Cycles in Doubly Weighted Directed Linear Graphs” Theory of Graphs, Int. Symp., Roma, Italy, July 1966, published by Dunod. Paris and Gordon and Breach, N.Y., pp. 209–213.Google Scholar
  9. [9]
    R. Bellman, “Functional Equations in the Theory of Dynamic Programming, XI—Limit Theorems” Rend. Circolo Mat. Palermo, vol. 8, n. 3, pp. 343–345, 1959.Google Scholar
  10. [10]
    A. Kaufman and R. Cruon, “Dynamic Programming” Academic Press, New York, 1967.Google Scholar
  11. [11]
    S. Rinaldi and P. Rozzoni, “Iterative Methods in Function Space for the Optimization of Markov Chains” Ricerca Operativa, n. 2, pp. 35–37, April 1971 (in Italian).Google Scholar
  12. [12]
    P. Dorato, “Steady State Optimal Control of Finite-State Machines” Automatica (IFAC Journal), vol. 7, n. 3, pp. 351–358, May 1971.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    B. Fox, “Finding Minimal Cost-Time Ratio Circuits” Operations Research, vol. 17, n. 3, pp. 546–550, May-June 1969.Google Scholar
  14. [14]
    G.B. Dantzig, “Linear Programming and Extensions” Princeton University Press, Princeton, N.J., 1963.Google Scholar
  15. [15]
    J.Y. Yen, “On the Efficiencies of Algorithms for Detecting Negative Loops in Networks” Santa Clara Business Review, University of Santa Clara, California, vol. 2, n. 1, pp. 52–58, 1971.Google Scholar
  16. [16]
    J.Y. Yen, “An Algorithm for Finding Shortest Routes from All Source Nodes to Given Destination in General Networks” Quart. Appl. Math., vol. 27, n. 4, pp. 526–530, Jan. 1970.MathSciNetMATHGoogle Scholar
  17. [17]
    F. Shapiro, “Shortest Route Methods for Finite State Space Dynamic Programming Problems” SIAM J. Applied Math., vol. 16, pp. 1232–1250, 1968.MATHGoogle Scholar
  18. [18]
    R. Aris, G.L. Nemhauser and D.J. Wilde, “Optimization of Multistage Cyclic and Branching Systems by Serial Procedures” AIChE J., vol. 10, n. 6, pp. 913–919, Nov. 1964.Google Scholar
  19. [19]
    U. Bertelé and F. Brioschi, “Non Serial Dynamic Programming” Academic Press, New York, 1973.Google Scholar
  20. [20]
    R.A. Cunningham-Green, “Describing Industrial Processes with Interference and Approximating their Steady-State Behavior” Operational Research Quarterly, vol. 13, pp. 95–100, 1965.CrossRefGoogle Scholar
  21. [21]
    R. Reiter, “Scheduling Parallel Computations” J. of ACM, vol. 15, n. 4, pp. 590–599, Oct. 1968.MATHCrossRefGoogle Scholar

Copyright information

© CISM, Udine 1975

Authors and Affiliations

  • S. Rinaldi
    • 1
  1. 1.Istituto di Elettrotecnica ed ElettronicaPolitecnico di MilanoItaly

Personalised recommendations