Minimum cost flows with minimum quantities

Information Processing Letters

Volumn 111, Issue 11, 2011, Pages 533-537

  Krumke, Sven O ^a   Thielen, Clemens ^a  

^a University of Koblenz Landau   (Germany)

Author keywords

Approximation scheme; Computational complexity; Minimum cost flow

Indexed keywords

APPROXIMATION SCHEME; COMPUTABLE FUNCTIONS; EXACT ALGORITHMS; FEASIBLE SOLUTION; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; LOWER BOUNDS; MINIMUM COST FLOW PROBLEM; MINIMUM COST FLOWS; NP COMPLETE; POLYNOMIAL-TIME; SERIES-PARALLEL GRAPH;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST ACCOUNTING; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

COSTS;

EID: 79952705006     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2011.03.007     Document Type: Article

References (6)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows 1993 Prentice-Hall
2. H.G. Seedig, Network flow optimization with minimum quantities, in: Proceedings of the International Conference on Operations Research, 2010.
3. X. Zhu, Q. Yuan, A. Garcia-Diaz, and L. Dong Minimal-cost network flow problems with variable lower bounds on arc flows Computers and Operations Research 38 8 2011 1210 1218
4. M.R. Garey, and D.S. Johnson Computers and Intractability (A Guide to the Theory of NP-Completeness) 1979 W.H. Freeman and Company
5. I. Demgensky, H. Noltemeier, and H.-C. Wirth On the flow cost lowering problem European Journal of Operations Research 137 2 2002 265 271 (Pubitemid 33149450)
6. J. Valdes, R.E. Tarjan, and E.L. Lawler The recognition of series parallel digraphs SIAM Journal on Computing 11 2 1982 298 313