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

DOI10.1023/A:1008372614175MaRDI QIDQ1567071zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Strongly polynomial algorithm for two special minimum concave cost network flow problems
• scientific article; zbMATH DE number 792650
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm

Cited in

(4)

• Quadratic programming and combinatorial minimum weight product problems
• Solving a class of generalized fractional programming problems using the feasibility of linear programs
• scientific article; zbMATH DE number 437576 (Why is no real title available?)
• An FPTAS for optimizing a class of low-rank functions over a polytope

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567071)