Greedy concepts for network flow problems

This publication has 8 references indexed in Scilit:

• Linear-time computation of optimal subgraphs of decomposable graphs
  Journal of Algorithms, 1987
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
  Operations Research, 1986
• On greedy algorithms that succeed
  Published by Cambridge University Press (CUP) ,1985
• On Transportation Problems with Upper Bounds on Leading Rectangles
  SIAM Journal on Algebraic Discrete Methods, 1985
• Minimum cost flow algorithms for series-parallel networks
  Discrete Applied Mathematics, 1985
• Submodular functions and convexity
  Published by Springer Nature ,1983
• The Recognition of Series Parallel Digraphs
  SIAM Journal on Computing, 1982
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
  Operations Research, 1964