scientific article; zbMATH DE number 3908197

From MaRDI portal
Publication:3686523





[For the entire collection see Zbl 0566.00033.] Network optimization not only has a long and distinguished history within the field of mathematical programming, but also continues to be one of the principal ongoing areas of research in optimization. This is due in part to the abundance of network applications, and in part to the fortuitous confluence of mathematical theory and computer science research that makes possible the optimization of linear network problems involving millions of variables, while simultaneously posing the challenge of adapting these techniques to nonlinear networks with thousands of variables. This paper endeavors to survey recent theoretical and computational developments in network optimization, with emphasis on convex as opposed to nonconvex or combinatorial problems.











This page was built for publication:

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