On the flow cost lowering problem

European Journal of Operational Research

Volumn 137, Issue 2, 2002, Pages 265-271

  Demgensky, I ^a   Noltemeier, H ^a   Wirth, H C ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Budget constrained upgrade problem; Minimum cost flow; Series parallel graph

Indexed keywords

COSTS; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION;

FLOW COST LOWERING PROBLEMS (FCLP); MINIMUN COST FLOW PROBLEM (MCFP);

OPERATIONS RESEARCH;

EID: 0036497542     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00208-9     Document Type: Article

References (6)

1. A threshold of ln n for approximating set cover
2. Flow improvement and flows with fixed costs
3. The recognition of series-parallel digraphs