Polynomial algorithms for a class of minimum rank-two cost path problems
From MaRDI portal
Publication:1567071
DOI10.1023/A:1008372614175zbMath0961.90082MaRDI QIDQ1567071
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
global optimization; shortest path; polynomial algorithm; Dijkstra's algorithm; directed path of minimum rank-two monotonic cost; low rank monotonicity
90C26: Nonconvex programming, global optimization
90B10: Deterministic network models in operations research
Related Items
An FPTAS for optimizing a class of low-rank functions over a polytope, Quadratic programming and combinatorial minimum weight product problems, Solving a class of generalized fractional programming problems using the feasibility of linear programs