Solving the Top-percentile traffic routing problem by Approximate Dynamic Programming

ISSN： 1471-6798

Source： IMA Journal of Management Mathematics, Vol.23, Iss.4, 2012-10, pp. : 413-434

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

Approximate dynamic programming: solving the curses of dimensionality

By Pardalos Panos

Optimization Methods and Software, Vol. 24, Iss. 1, 2009-02 ,pp. : 155-155

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximate dynamic programming via iterated Bellman inequalities

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Vol. 25, Iss. 10, 2015-07 ,pp. : 1472-1496

John Wiley & Sons Inc

Access to resources Recommend Favorite

Layered-routing approach for solving multicast routing and wavelength assignment problem

By Poo Gee-Swee Ding Aijun

Photonic Network Communications, Vol. 13, Iss. 2, 2007-04 ,pp. : 123-137

Springer Publishing Company

Access to resources Recommend Favorite

Improved Noniterative Algorithm for Solving the Traffic Equilibrium Problem

By Raciti F. Falsaperla P.

Journal of Optimization Theory and Applications, Vol. 133, Iss. 3, 2007-06 ,pp. : 401-411

Springer Publishing Company

Access to resources Recommend Favorite

Ant Colony System for a Dynamic Vehicle Routing Problem

By Montemanni R. Gambardella L. Rizzoli A. Donati A.

Journal of Combinatorial Optimization, Vol. 10, Iss. 4, 2005-12 ,pp. : 327-343

Springer Publishing Company

Access to resources Recommend Favorite