CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...

With the goal of advancing the state of art of our understanding of BP, we study the performance of BP in the context of the capacitated minimum-cost network flow problem—a cornerstone in the ...

branch-and-bound algorithm, network-flow optimization models, nonlinear optimization introduction, formulating and solving optimization problems with the AMPL modeling software, and examples in ...