Greedy concepts for network flow problems

DOI10.1016/0166-218X(86)90037-5zbMATH Open0617.90027MaRDI QIDQ1088884FDOQ1088884

Authors: Wolfgang W. Bein, Peter Brucker 

Publication date: 1986

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

Recommendations

• Minimum cost flow algorithms for series-parallel networks
• On greedy algorithms for series parallel graphs
• Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
• scientific article; zbMATH DE number 1029233
• Series parallel composition of greedy linear programming problem

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Minimum cost flow algorithms for series-parallel networks
• The Recognition of Series Parallel Digraphs
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On Transportation Problems with Upper Bounds on Leading Rectangles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Greedy packing and series-parallel graphs
• Title not available (Why is that?)
• Series parallel composition of greedy linear programming problem
• Greedy oriented flows
• Some recent results in the analysis of greedy algorithms for assignment problems
• Minimum cost flow algorithms for series-parallel networks
• Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
• Title not available (Why is that?)
• On greedy algorithms for series parallel graphs

This page was built for publication: Greedy concepts for network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088884)