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

This publication has 16 references indexed in Scilit:

• Modeling the satellite placement problem as a network flow problem with one side constraint
  OR Spectrum, 1991
• Faster parametric shortest path and minimum‐balance algorithms
  Networks, 1991
• Shortest path algorithms using dynamic breadth-first search
  Networks, 1991
• Finding minimum-cost circulations by canceling negative cycles
  Journal of the ACM, 1989
• Fibonacci heaps and their uses in improved network optimization algorithms
  Journal of the ACM, 1987
• Computing optimal scalings by parametric network algorithms
  Mathematical Programming, 1985
• A minimum concave-cost dynamic network flow problem with an application to lot-sizing
  Networks, 1985
• Parametric shortest path algorithms with an application to cyclic staffing
  Discrete Applied Mathematics, 1981
• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
  Numerische Mathematik, 1980
• A characterization of the minimum cycle mean in a digraph
  Discrete Mathematics, 1978