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

DOI10.1002/net.3230210702zbMath0743.90109OpenAlexW1968615825MaRDI QIDQ3984276

Dayong Jin, Cheng'en Yang

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)

Related Items (2)

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

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