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

DOI10.1023/A:1008372614175zbMath0961.90082OpenAlexW125350291MaRDI QIDQ1567071

Takahito Kuno

Publication date: 5 June 2000

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008372614175

zbMATH Keywords

global optimizationshortest pathpolynomial algorithmDijkstra's algorithmdirected path of minimum rank-two monotonic costlow rank monotonicity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10)

Related Items (3)

Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ An FPTAS for optimizing a class of low-rank functions over a polytope ⋮ Quadratic programming and combinatorial minimum weight product problems

This page was built for publication: Polynomial algorithms for a class of minimum rank-two cost path problems