Login / Signup

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

Mark HartmannJames B. Orlin
Published in: Networks (1993)
Keyphrases
  • minimum cost
  • np hard
  • approximation algorithms
  • spanning tree
  • network flow
  • capacity constraints
  • network flow problem
  • minimum cost flow
  • network simplex algorithm
  • special case
  • upper bound
  • linear programming