Accelerated parallel projection method for solving the shortest distance problem

MaRDI QIDQ2907419zbMATH OpenFDO

Authors Dmitry V. Dolgy, E. A. Nurminski

Publication date 9 September 2012

Published in Advanced Studies in Contemporary Mathematics (Kyungshang) (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmprojectionsimplex

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Recommendations

• Faster parallel algorithm for approximate shortest path
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 811530
• Parallel algorithms for solving aggregated shortest-path problems
• Optimal parallel algorithms for rectilinear link-distance problems
• Computational acceleration of projection algorithms for the linear best approximation problem
• Parallel algorithms for shortest path problems in polygons
• A parallel shortest path algorithm

Cited in

(1)

• Convergence of suitable affine subspace method for finding the least distance to a simplex

This page was built for publication: Accelerated parallel projection method for solving the shortest distance problem

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