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

ISSN： 1862-4472

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

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 polynomial time approximation algorithm for the two-commodity splittable flow problem

By Eisenschmidt Elke Haus Utz-Uwe

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

Springer Publishing Company

Access to resources Recommend Favorite

The homotopy of the [TEX equation: K(2)] -local Moore spectrum at the prime [TEX equation: 3] revisited

By Henn Hans-Werner Karamanov Nasko Mahowald Mark

Mathematische Zeitschrift, Vol. 275, Iss. 3-4, 2013-12 ,pp. : 953-1004

Springer Publishing Company

Access to resources Recommend Favorite

Heuristic Algorithms for Solving a Large Scale Multicommodity Flow Problem on a Network with a Step Function Cost

STUDIES IN APPLIED MATHEMATICS, Vol. 22-2526, Iss. 3, 1975-09 ,pp. : 207-227

John Wiley & Sons Inc

Access to resources Recommend Favorite

Heuristic Algorithms for Solving a Large Scale Multicommodity Flow Problem on a Network with a Step Function Cost

STUDIES IN APPLIED MATHEMATICS, Vol. 54, Iss. 3, 1975-09 ,pp. : 207-227

John Wiley & Sons Inc

Access to resources Recommend Favorite

Phased local search for the maximum clique problem

By Pullan Wayne

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 303-323

Springer Publishing Company

Access to resources Recommend Favorite