Cyclic scheduling and combinatorial topology: Assignment and routing of motive power to meet scheduling and maintenance requirements Part I ‐ A statement of the operating problem of the Frisco railroad

V. B. Gleaves

Naval Research Logistics Quarterly, 1957, vol. 4, issue 3, 203-205

Abstract: A new method is developed for the nonlinear problem of optimal cyclic assignment of motive power, which derives essentially from the association of a graph with the time‐table.

Date: 1957
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800040307

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:4:y:1957:i:3:p:203-205

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().