Letter to the Editor—Finding Minimal Cost-Time Ratio Circuits

Bennett Fox
Additional contact information
Bennett Fox: The Rand Corporation, Santa Monica, California

Operations Research, 1969, vol. 17, issue 3, 546-551

Abstract: In the treatment of routing problems, other authors have used column generators to introduce, into the basis of the master problem, the solution that corresponds to a cycle in a graph with minimal cost-to-time ratio. This subproblem is of independent interest and corresponds to deterministic Markov renewal programming; this note presents an efficient method for its solution, intuitive basis for which is a search for a way to route flow so that the cost-time trade-off is optimal. This flow-circulation problem is solved parametrically by the out-of-kilter algorithm.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.3.546 (application/pdf)

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:inm:oropre:v:17:y:1969:i:3:p:546-551

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().