Finding minimum cost to time ratio cycles with small integral transit times
- 1 September 1993
- Vol. 23 (6), 567-574
- https://doi.org/10.1002/net.3230230607
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Modeling the satellite placement problem as a network flow problem with one side constraintOR Spectrum, 1991
- Faster parametric shortest path and minimum‐balance algorithmsNetworks, 1991
- Shortest path algorithms using dynamic breadth-first searchNetworks, 1991
- Finding minimum-cost circulations by canceling negative cyclesJournal of the ACM, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Computing optimal scalings by parametric network algorithmsMathematical Programming, 1985
- A minimum concave-cost dynamic network flow problem with an application to lot-sizingNetworks, 1985
- Parametric shortest path algorithms with an application to cyclic staffingDiscrete Applied Mathematics, 1981
- An algorithm for scaling matrices and computing the minimum cycle mean in a digraphNumerische Mathematik, 1980
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978