Polynomial algorithms for a class of minimum rank-two cost path problems

  • Authors:

  • Takahito Kuno

  • Affiliations:

  • Institute of Information Sciences and Electronics, University of Tsukuba, Japan

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we develop two algorithms for finding a directed path of minimum rank-two monotonic cost between two specified nodes in a network with n nodes and m arcs. Under the condition that one of the vectors characterizing the cost function f is binary, one yields an optimal solution in O(n_3) or O(nm log n) time if f is quasiconcave; the other solves any problem in O(nm+n_2log n) time.