A polynomial time approximation algorithm for the two-commodity splittable flow problem

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.77, Iss.3, 2013-06, pp. : 381-391

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A new strategy for the undirected two-commodity maximum flow problem

By Sedeño-Noda A. González-Martín C. Alonso-Rodríguez S.

Computational Optimization and Applications, Vol. 47, Iss. 2, 2010-10 ,pp. : 289-305

Springer Publishing Company

Access to resources Recommend Favorite

A local search heuristic for the Multi-Commodity [TEX equation: k] -splittable Maximum Flow Problem

By Gamst M.

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 919-937

Springer Publishing Company

Access to resources Recommend Favorite

Two-Scale Algorithm of Simulating the Approximation for the Piezoelectric Problem in Small Periodic Composites

Materials Science Forum, Vol. 2016, Iss. 880, 2017-02 ,pp. : 90-94

Trans Tech Publications

Access to resources Recommend Favorite

Polynomial approximation on family of two half-balls

By Mezhevich K. Shirokov N.

Journal of Mathematical Sciences, Vol. 142, Iss. 2, 2007-04 ,pp. : 2020-2020

Springer Publishing Company

Access to resources Recommend Favorite

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

By Hong S.-P. Chung S.-J. Park B.H.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 233-239

Elsevier

Access to resources Recommend Favorite