Finding minimum cost to time ratio cycles with small integral transit times-Reference-Cited by-同舟云学术

Finding minimum cost to time ratio cycles with small integral transit times

Published:1993-09 Issue:6 Volume:23 Page:567-574
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Hartmann Mark,Orlin James B.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference28 articles.

1. , and , Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993).

2. Cyclic Scheduling via Integer Programs with Circular Ones

3. , , and , Balancing problems in acyclic networks. To appear in Discrete Applied Mathematics.

4. Performance Analysis and Optimization of Asyncronous Circuits. Ph.D. Thesis, Department of Computer Science, California Institute of Technology, Pasadena (1991).

5. , and . Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. In: ed. Theory of Graphs. Dunod, Paris, and Gordon and Breach, New York (1967) 77–84.

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Comment faire un demi-tour dans la Tour d'Hanoï Cyclique;Bulletin of the Belgian Mathematical Society - Simon Stevin;2024-07-06

2. Density of identifying codes of hexagonal grids with finite number of rows;RAIRO - Operations Research;2024-03

3. Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory;SIAM Journal on Optimization;2022-08-01

4. A Scalable Buffer Queue Sizing Algorithm for Latency Insensitive Systems;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2021-11

5. Faster algorithms for quantitative verification in bounded treewidth graphs;Formal Methods in System Design;2021-04-29