On a negative-equivalency theorem in associative optimal path problems

DOI10.1080/02331930008844498MaRDI QIDQ4500803zbMATH OpenOpenAlexFDO

Authors Yukihiro Maruyama

Publication date 22 March 2004

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930008844498

zbMATH Keywords

bitonic semigroupnegative-equivalency theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1783871
• scientific article; zbMATH DE number 1062626
• On the shortest path problem with negative cost cycles
• Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
• scientific article; zbMATH DE number 1305474
• scientific article; zbMATH DE number 509206
• scientific article; zbMATH DE number 1406530
• The structure of the optimal solution set on the shortest paths for networks
• On the length of simplex paths: The assignment case
• On fixed-parameter solvability of the minimax path location problem

Cites work

• A new look at Bellman's principle of optimality
• An Algebra for Network Routing Problems
• An Appraisal of Some Shortest-Path Algorithms
• From dynamic programming to bynamic programming
• Shortest and longest path problems

Cited in

(5)

• Shortest and longest path problems
• scientific article; zbMATH DE number 1062626 (Why is no real title available?)
• scientific article; zbMATH DE number 2038137 (Why is no real title available?)
• scientific article; zbMATH DE number 1783871 (Why is no real title available?)
• scientific article; zbMATH DE number 1406530 (Why is no real title available?)

This page was built for publication: On a negative-equivalency theorem in associative optimal path problems

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