Alan J. Hoffman, Arthur F. Veinott Jr.
Mathematical Programming
Paper
On greedy algorithms for series parallel graphs
Abstract
This note describes some sufficient conditions for the maximum or minimum of a weighted flow (the weights are on paths, and are derived from weights on the edges of the path), of given volume in a series parallel graph to be found by a greedy algorithm. © 1988 The Mathematical Programming Society, Inc.
Related
Jean-Louis Goffin, Alan J. Hoffman
Linear Algebra and Its Applications
Ulrich Faigle, Alan J. Hoffman, et al.
SIAM Journal on Discrete Mathematics
Alan J. Hoffman, Baruch Schieber
Discrete Applied Mathematics