This course covers advanced topics in network optimization on continuous and discrete models, including the max-flow problem, the min-cost flow problem, simplex methods for min-cost flow, dual ascent ...

This is a preview. Log in through your library . Abstract In an observational study in which each treated subject is matched to several untreated controls by using observed pretreatment covariates, a ...

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...