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

E-ISSN： 1467-9590|54|3|207-227

ISSN： 0022-2526

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

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

Abstract

Related content

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 Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem

STUDIES IN APPLIED MATHEMATICS, Vol. 22-2526, Iss. 1, 1975-03 ,pp. : 31-60

John Wiley & Sons Inc

Access to resources Recommend Favorite

Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem

STUDIES IN APPLIED MATHEMATICS, Vol. 54, Iss. 1, 1975-03 ,pp. : 31-60

John Wiley & Sons Inc

Access to resources Recommend Favorite

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

By Mofya E. Smith J.

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 231-256

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