New scaling algorithms for the assignment and minimum mean cycle problems

@article{Orlin1992NewSA,
  title={New scaling algorithms for the assignment and minimum mean cycle problems},
  author={J. Orlin and R. Ahuja},
  journal={Mathematical Programming},
  year={1992},
  volume={54},
  pages={41-56}
}
  • J. Orlin, R. Ahuja
  • Published 1992
  • Mathematics, Computer Science
  • Mathematical Programming
AbstractIn this paper we suggest new scaling algorithms for the assignment and minimum mean cycle problems. Our assignment algorithm is based on applying scaling to a hybrid version of the recentauction algorithm of Bertsekas and the successive shortest path algorithm. The algorithm proceeds by relaxing the optimality conditions, and the amount of relaxation is successively reduced to zero. On a network with 2n nodes,m arcs, and integer arc costs bounded byC, the algorithm runs in O( $$\sqrt n… Expand
Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory
An O(nm) time algorithm for finding the min length directed cycle in a graph
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
Directed Shortest Paths via Approximate Cost Balancing
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
Approximating the minimum cycle mean
The quickest flow problem
Approximating the minimum cycle mean
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
The auction algorithm for the minimum cost network flow problem
Dual coordinate step methods for linear network flow problems
The auction algorithm: A distributed relaxation method for the assignment problem
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  • R. Karp
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1977
Finding minimum-cost circulations by canceling negative cycles
Network Flow and Testing Graph Connectivity
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
  • Numerische Mathematik
  • 1959
Parametric shortest path algorithms with an application to cyclic staffing
A characterization of the minimum cycle mean in a digraph
  • R. Karp
  • Computer Science, Mathematics
  • Discret. Math.
  • 1978
...
1
2
3
4
...