Skip to main content

Characteristics of incremental assignment method

  • Software Problems
  • Conference paper
  • First Online:
Optimization Techniques

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 23))

Abstract

As the characteristics of this method, it could be summarized : (a) the algorithm reflects the existing procedure, (b) intermediate results are also valuable, (c) large scale network can be treated by the small size computer.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. V. Martin and M. L. Manheim, A research program for compatison of traffic assignment techniques, HRb Record. 88 (Jan. 1964).

    Google Scholar 

  2. B. V. Martin, A computer program for traffic assignment research, MIT Research Report R 64-41 (Dec. 1964).

    Google Scholar 

  3. Principles and techniques in planning of transportation networks, Ministry of Transportation, Planning Board, Japan, Report No. 15, 1969, Report No. 32, 1970 (in Japanese).

    Google Scholar 

  4. Survey report on the effects of national highway network construction, Ministry of Construction, Bureau of Road, Japan, 1970 (in Japanese).

    Google Scholar 

  5. S. Moriguti, M. Iri, A. Nagaya, A sequential method in multicommodity transportation problem, Conference Report 1-1-7, pp. 21–22, Operations Research Society of Japan, 1970 (in Japanese).

    Google Scholar 

  6. S. Moriguti, M. Iri, Y. Tukamoto, Flow capacity correction method in multi-commodity transportation problem, Conference Report, 1-1-8, pp. 23–24, Operations Research Society of Japan, 1970 (in Japanese).

    Google Scholar 

  7. System analysis of new urban system in which population concentrates effectively, JUSE, 1971 (in Japanese).

    Google Scholar 

  8. Y. Ishizaki, N. Yoshida. S. Sasabe and Y. Ishiyama, Multicommodity flow approach to assignment of circuit in case of fialure in a communication network, IX International Conference on Mathematical Programming, Budapest, Hungary, 1976.

    Google Scholar 

  9. A special issue on incremental assignment method, Communications of the Operations Research Society of Japan, Vol. 22, No. 12, pp. 688–719, 1977 (in Japanese).

    Google Scholar 

  10. K. Okudaira, History and applications, pp. 688–694.

    Google Scholar 

  11. M. Iri, Incremental assignment method from the view point of mathematical programming, pp. 695–701.

    Google Scholar 

  12. S. Moriguti, Oscillation and convergence in incremental assignment method, pp. 702–710.

    Google Scholar 

  13. S. Goto, Applications of incremental assignment method to the design of communication network, pp. 711–719.

    Google Scholar 

  14. K. Okudaira, Introduction on urban system analysis, Shokokukansha, 1976 (in Japanese).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

K. Iracki K. Malanowski S. Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Yajima, K. (1980). Characteristics of incremental assignment method. In: Iracki, K., Malanowski, K., Walukiewicz, S. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006611

Download citation

  • DOI: https://doi.org/10.1007/BFb0006611

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10081-2

  • Online ISBN: 978-3-540-38253-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics