Publication | Closed Access

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Mathematical ProgrammingNetwork Simplex AlgorithmEngineeringNetwork AnalysisEducationDiscrete OptimizationOperations ResearchAlgorithm DesignDiscrete MathematicsNetwork OptimizationCombinatorial OptimizationNetwork FlowsComputer ScienceNetwork ScienceGraph TheoryNetwork AlgorithmDynamic TreesMaximum Flow ProblemDynamic Programming