On greedy algorithms for series parallel graphs

DOI10.1007/BF01580730zbMath0652.90040MaRDI QIDQ1107418

Alan J. Hoffman

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmseries parallel graphdirected multigraphflows in networkssingle sinksingle source

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

Perspectives of Monge properties in optimization ⋮ Integrality in the multinetwork min‐cost equal‐flow problem ⋮ The nestedness property of the convex ordered median location problem on a tree ⋮ Series parallel composition of greedy linear programming problem

Cites Work

• Minimum cost flow algorithms for series-parallel networks
• Classes of linear programs with integral optimal solutions

This page was built for publication: On greedy algorithms for series parallel graphs