Approximation of the steepest descent direction for the O-D matrix adjustment problem

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.144, Iss.1, 2006-04, pp. : 329-362

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

Using QIGSO with steepest gradient descent strategy to direct orbits of chaotic systems

By Zhu Zhuanghua

International Journal of Computational Science and Engineering, Vol. 7, Iss. 2, 2012-07 ,pp. : 133-138

Inderscience Publishers

Access to resources Recommend Favorite

A 1-d.o.f. Dynamic Pitching Robot That Independently Controls Velocity, Angular Velocity and Direction of a Ball

By Mori Wataru Ueda Jun Ogasawara Tsukasa

Advanced Robotics, Vol. 24, Iss. 5-6, 2010-04 ,pp. : 921-942

Taylor & Francis Ltd

Access to resources Recommend Favorite

New approximation algorithm for RTILE problem

By Lorys K. Paluch K.E.

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 517-537

Elsevier

Access to resources Recommend Favorite

Approximation Algorithms for the Unsplittable Flow Problem

By Chakrabarti Amit Chekuri Chandra Gupta Anupam Kumar Amit

Algorithmica, Vol. 47, Iss. 1, 2007-01 ,pp. : 53-78

Springer Publishing Company

Access to resources Recommend Favorite

GPUSGD: A GPU‐accelerated stochastic gradient descent algorithm for matrix factorization

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 28, Iss. 14, 2016-09 ,pp. : 3844-3865

John Wiley & Sons Inc

Access to resources Recommend Favorite