Greedy concepts for network flow problems

DOI10.1016/0166-218X(86)90037-5zbMath0617.90027MaRDI QIDQ1088884

Peter Brucker, Wolfgang W. Bein

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmseries-parallel networksparallel compositiontree structuresaugmenting path methodcost optimal flowpolymatroidalseries composition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items

Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming, Some recent results in the analysis of greedy algorithms for assignment problems, Series parallel composition of greedy linear programming problem

Cites Work

• Minimum cost flow algorithms for series-parallel networks
• On Transportation Problems with Upper Bounds on Leading Rectangles
• The Recognition of Series Parallel Digraphs
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item