57 search results - page 1 / 12 » Combinatorial algorithms for the minimum interval cost flow ... |
62
Voted
AMC
2006
14 years 10 months ago
2006
70
Voted
STOC
1999
ACM
15 years 2 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...
80
Voted
IPCO
1998
14 years 11 months ago
1998
100
click to vote
ALGORITHMICA
2010
14 years 10 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
EOR
2008
14 years 10 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...