Series parallel composition of greedy linear programming problem

DOI10.1007/BF01585157zbMath0801.90076MaRDI QIDQ1321658

Wolfgang W. Bein, Alan J. Hoffman, Peter Brucker

Publication date: 28 April 1994

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

zbMATH Keywords

series parallel graphsgreedy methodMonge arrays

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items

Perspectives of Monge properties in optimization, Integrality in the multinetwork min‐cost equal‐flow problem, Generalized max flow in series-parallel graphs, What the transportation problem did for me, A Monge property for the \(d\)-dimensional transportation problem, Some recent results in the analysis of greedy algorithms for assignment problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum cost flow algorithms for series-parallel networks
• Greedy concepts for network flow problems
• On greedy algorithms for series parallel graphs
• Classes of linear programs with integral optimal solutions