A primal-dual algorithm for the minimum average weighted length circuit problem

DOI10.1002/NET.3230210702MaRDI QIDQ3984276zbMATH OpenOpenAlexFDO

Authors Cheng'en Yang, Dayong Jin

Publication date 27 June 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230210702

zbMATH Keywords

pseudo-polynomial time algorithmminimum average weighted length circuit problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network
• On paths with the shortest average arc length in weighted graphs
• Algorithms for finding the minimum cycle mean in the weighted directed graph
• An O(nm) time algorithm for finding the min length directed cycle in a graph

Cited in

(2)

• A parametric critical path problem and an application for cyclic scheduling
• An efficient P-D algorithm for shortest path problem

This page was built for publication: A primal-dual algorithm for the minimum average weighted length circuit problem

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