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

Publisher： John Wiley & Sons Inc

E-ISSN： 1467-9590|54|1|31-60

ISSN： 0022-2526

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

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

By  

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

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

By  

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

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

Solving Large-scale Profit Maximization Capacitated Lot-size Problems by Heuristic Methods

By Haugen Kjetil   Olstad Asmund   Pettersen Bård  

Journal of Mathematical Modelling and Algorithms, Vol. 6, Iss. 1, 2007-03 ,pp. : 135-149

Springer Publishing Company

Access to resources Recommend Favorite

A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 4, 2015-12 ,pp. : 364-379

John Wiley & Sons Inc

Access to resources Recommend Favorite