Publication | Closed Access

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems

Mathematical ProgrammingNetwork FlowsNetwork ScienceDynamic Programming ApproachEngineeringOptimization ProblemNetwork PlanningBusinessNetwork AnalysisDynamic ProgrammingSystems EngineeringLogisticsNetwork OptimizationDiscrete OptimizationCombinatorial OptimizationOperations Research