ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM

DOI10.1142/S0217595908001699zbMATH Open1171.90349MaRDI QIDQ3520508FDOQ3520508

Authors: I-Lin Wang 

Publication date: 26 August 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Recommendations

• A least-squares primal-dual algorithm for solving linear programming problems
• Efficient Shortest Path Simplex Algorithms
• An Auction Algorithm for Shortest Paths
• A least-squares minimum-cost network flow algorithm
• Dual algorithms for the shortest path tree problem

zbMATH Keywords

Dijkstra's algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• A note on two problems in connexion with graphs
• A strictly improving linear programming Phase I algorithm
• A least-squares primal-dual algorithm for solving linear programming problems

Cited In (4)

• Dijkstra's algorithm and L-concave function maximization
• MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles
• Title not available (Why is that?)
• Solving elementary shortest-path problems as mixed-integer programs

This page was built for publication: ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM

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