95 search results - page 1 / 19 » Heuristic solutions for general concave minimum cost network... |
NETWORKS
2007
13 years 10 months ago
2007
EOR
2008
13 years 11 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
SIAMDM
2010
13 years 6 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
NETWORKS
2010
13 years 9 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
STOC
1999
ACM
14 years 3 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...