Portal de Periódicos da CAPES

A Method for Solving Network Flow Problems with General Nonlinear Arc Costs

1993; Linguagem: Inglês

10.1142/9789812798190_0009

1793-0928

Bruce W. Lamar,

Advanced Manufacturing and Logistics Optimization

Series on Applied MathematicsNetwork Optimization Problems: Algorithms, Applications and Complexity, pp. 147-167 (1993) No AccessA Method for Solving Network Flow Problems with General Nonlinear Arc CostsBruce W. LamarBruce W. LamarDepartment of Management, University of Canterbury, Christchurch, New Zealandhttps://doi.org/10.1142/9789812798190_0009Cited by:13 (Source: Crossref) PreviousNext AboutSectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack CitationsRecommend to Library ShareShare onFacebookTwitterLinked InRedditEmail Abstract: General nonlinear network flow problems concern the minimization of costs over networks involving arcs with arbitrary cost functions. Finding the optimal solution to such problems is challenging because the arc cost functions are, in general, neither convex nor concave. This paper presents a procedure for converting any network with general nonlinear arc cost functions into an equivalent network containing only concave arc cost functions. This conversion procedure permits established solution methods for concave minimum cost network flow problems to be applied to networks with arbitrary arc cost functions. FiguresReferencesRelatedDetailsCited By 13Cited by lists all citing articles based on Crossref citation.A polynomial local optimality condition for the concave piecewise linear network flow problemZhibin Nie, Shuning Wang and Xiaolin Huang1 Jan 2020 | AIMS Mathematics, Vol. 6, No. 3A Solution Approach to the Nonconvex Piecewise Linear Network Flow ProblemsYu Bai, Zhiming Xu and Shuning Wang1 Jul 2018Concave minimum cost network flow problems solved with a colony of antsMarta S. R. Monteiro, Dalila B. M. M. Fontes and Fernando A. C. C. Fontes27 November 2012 | Journal of Heuristics, Vol. 19, No. 1Minimum Concave Transportation ProblemsBruce W. Lamar1 Jan 2008Nonconvex Network Flow ProblemsBruce W. Lamar1 Jan 2008Heuristic solutions for general concave minimum cost network flow problemsDalila B.M.M. Fontes and José Fernando Gonçalves1 January 2007 | Networks, Vol. 50, No. 1Network optimization in supply chain management and financial engineering: An annotated bibliographyJoseph Geunes and Panos M. Pardalos22 July 2003 | Networks, Vol. 42, No. 2Minimum Concave Transportation ProblemsBruce W. Lamar1 Jan 2001Nonconvex Network Flow ProblemsBruce W. Lamar1 Jan 2001Piecewise Linear Network Flow ProblemsDukwon Kim1 Jan 2001Solution Methods for Nonconvex Network Flow ProblemsGavin J. Bell and Bruce W. Lamar1 Jan 1997Network ProblemsG. M. Guisewite1 Jan 1995An improved branch and bound algorithm for minimum concave cost network flow problemsBruce W. Lamar1 Jan 1993 | Journal of Global Optimization, Vol. 3, No. 3 Recommended Network Optimization Problems: Algorithms, Applications and Complexity Metrics History PDF download