An efficient P-D algorithm for shortest path problem

DOI10.1007/BF02015143MaRDI QIDQ1367256zbMATH OpenFDO

Authors Cheng'en Yang, Shuli Liang

Publication date 1997

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02015143

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites work

• A note on two problems in connexion with graphs
• A primal-dual algorithm for the minimum average weighted length circuit problem
• scientific article; zbMATH DE number 3121287 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)

This page was built for publication: An efficient P-D algorithm for shortest path problem

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