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

E-ISSN： 1097-0037|66|4|364-379

ISSN： 0028-3045

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

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

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

An efficient approximation algorithm for the survivable network design problem

By Gabow H.N. Goemans M.X. Williamson D.P.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 13-40

Elsevier

Access to resources Recommend Favorite

Bicriterion discrete equilibrium network design problem

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 63, Iss. 4, 2014-07 ,pp. : 286-305

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. 22-2526, Iss. 3, 1975-09 ,pp. : 207-227

John Wiley & Sons Inc

Access to resources Recommend Favorite