Optimal Cycles in Graphs and the Minimal Cost-to-time Ratio Problem

Eugene L. Lawler

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M343

1972

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1972/Archive/ERL-m-343.pdf

BibTeX citation:

@techreport{Lawler:M343,
    Author= {Lawler, Eugene L.},
    Title= {Optimal Cycles in Graphs and the Minimal Cost-to-time Ratio Problem},
    Year= {1972},
    Month= {May},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1972/29283.html},
    Number= {UCB/ERL M343},
}

EndNote citation:

%0 Report
%A Lawler, Eugene L. 
%T Optimal Cycles in Graphs and the Minimal Cost-to-time Ratio Problem
%I EECS Department, University of California, Berkeley
%D 1972
%@ UCB/ERL M343
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1972/29283.html
%F Lawler:M343