Transience Bounds for Long Walks

References

• Ahuja R. K. , Magnanti T. L. , Orlin J. B. Network Flows: Theory, Algorithms and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Arguelles M. C. Exploiting special structure to enhance efficiency of manufacturing simulation. (1998) . Ph.D. thesis, Department of Operations Research, University of North Carolina, Chapel Hill, NC Google Scholar
• Baccelli F. , Cohen G. , Olsder G. J. , Quadrat J.-P. Synchronization and Linearity: An Algebra for Discrete Event Systems (1992) (John Wiley and Sons, New York) Google Scholar
• Benjamin A. T. Graphs, maneuvers and turpikes. Oper. Res. (1990) 38 202 216 Link, Google Scholar
• Bondy J. A. , Murty U. S. R. Graph Theory with Applications (1976) (North-Holland, New York) Crossref, Google Scholar
• Braker J. G. , Resing J. A. C. , Balemi S. , et al. On a generalized asymptoticity problem in max algebra. Discrete Event Systems: Modeling and Control (1993) (Birkhäuser, Boston, MA) 125 139 Crossref, Google Scholar
• Braker J. G. , Resing J. A. C. Periodicity and critical circuits in a generalized max-algebra setting. Discrete Event Dyn. Syst. (1994) 4 293 314 Crossref, Google Scholar
• Brauer A. On a problem of partitions. Amer. J. Math. (1942) 64 299 312 Crossref, Google Scholar
• Brualdi R. A. Introductory Combinatorics (1977) (North-Holland, New York) Google Scholar
• Brualdi R. A. , Ryser H. J. Combinatorial Matrix Theory (1991) (Cambridge University Press, New York) Crossref, Google Scholar
• Chrétienne P. Chemins extrémaux d'un graphe doublement valué. RAIRO Rech. Opér. (1984) 18 221 245 Crossref, Google Scholar
• Chvátal V. , Cook W. , Hartmann M. On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. (1989) 114/115 455 499 Crossref, Google Scholar
• Chvátal V. , Garey M. R. , Johnson D. S. , Alspach B. , et al. Two results concerning multicolorings. Algorithmic Aspects of Combinatorics (1978) 2 151 154 . Ann. Discrete Math Crossref, Google Scholar
• Cohen G. , Dubois D. , Quadrat J. P. , Viot M. Analyse du comportment périodique de systèmes de production par la théorie des dioïdes. (1983) . Technical report RR-0191, INRIA Google Scholar
• Cohen G. , Dubois D. , Quadrat J. P. , Viot M. A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. IEEE Trans. Automat. Control (1985) AC-30 210 220 Crossref, Google Scholar
• Cuninghame-Green R. Minimax Algebra (1979) (Springer Verlag, New York) Crossref, Google Scholar
• Dantzig G. B. , Blattner W. , Rao M. R. , Rosenstiehl P. Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. Theory of Graphs (1967) (Gordon and Breach, New York) 77 84 Google Scholar
• Denardo E. V. Periods of connected networks and powers of nonnegative matrices. Math. Oper. Res. (1977) 2 20 24 Link, Google Scholar
• Dubois D. , Stecke K. E. , Mazzola J. B. Dynamic analysis of repetitive decision-free discrete-event processes: Applications to production systems. Automated Manufacturing Systems (1990) 26 (J. C. Baltzer AG, Basel) 323 347 . Ann. Oper. Res. Google Scholar
• Garey M. R. , Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Goverde R. M. P. , Bovy P. H. L. , Olsder G. J. The max-plus algebra approach to transportation problems. (1998) (TRAIL Research School, Delft) . Report Google Scholar
• Hartmann M. , Orlin J. B. Finding minimum cost to time ratio cycles with small integral transit times. Networks (1993) 23 567 574 Crossref, Google Scholar
• Hartmann M. , Schneider M. H. An analogue of Hoffman's circulation conditions for max-balanced flows. Math. Programming (1992) 57 459 476 Crossref, Google Scholar
• Karp R. M. A characterization of the minimum cycle mean in a digraph. Discrete Math. (1978) 23 309 311 Crossref, Google Scholar
• McCormick S. T. , Pinedo M. L. , Shenker S. , Wolf B. Transient behavior in a flexible assembly system. Internat. J. Flex. Manuf. Syst. (1990) 3 27 44 Crossref, Google Scholar
• Schneider H. , Schneider M. H. Max-balancing weighted directed graphs and matrix scaling. Math. Oper. Res. (1991) 16 208 220 Link, Google Scholar
• Schrijver A. Theory of Linear and Integer Programming (1986) (Wiley, Chichester) Google Scholar
• White D. J. Dynamic Programming (1969) (Holden-Day, San Fransisco) Google Scholar
• Young N. E. , Tarjan R. E. , Orlin J. B. Faster parametric shortest path and minimum-balance algorithms. Networks (1991) 21 205 221 Crossref, Google Scholar