Semigroup Forum

, Volume 8, Issue 1, pp 69–73 | Cite as

An equivalency problem in discrete programming over ordered semigroups

  • E. Ja. Gabovič
Article

Keywords

Equivalency Problem Discrete Programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Dinic, E.A. and Kronrod, M.A.,An algorithm for the solution of the assignment problem, Doklady Akad. Nauk SSSR 189 (1969), 23–25 (in Russian).Google Scholar
  2. [2]
    Ford, L.R., Jr., Fulkerson,D.R.,Flows in networks, Princeton Univ. Press, 1962.Google Scholar
  3. [3]
    Gabovič, E.Ja.,The traveling salesman problem, I, Trudy Vyčisl. Centra Tartu. Gos. Univ. 19 (1970), 52–96 (in Russian).Google Scholar
  4. [4]
    Gabovič, E.Ja.,The little traveling salesman problem, Trudy Vycisl. Centra Tartu. Gos. Univ. 19 (1970), 27–51 (in Russian).Google Scholar
  5. [5]
    Gabovič, E.Ja., Ciz, A. and Jalas, A.,The bottle-neck traveling salesman problem, Trudy Vycisl. Centra Tartu. Gos. Univ. 22 (1971), 3–24 (in Russian).Google Scholar
  6. [6]
    Gilmore, P.C., Gomory,R.E.,Sequencing a one-state varible machine:a solvable case of the traveling salesman problem, Oper. Res. 12 (1964), 655–679.Google Scholar
  7. [7]
    Goldštein, E.G. and Judin, D.B.,Problems in linear programming of transportation type, Nauka, Moscow, 1969 (in Russian).Google Scholar
  8. [8]
    Korbut, A.A. and Finkelštein, Ju.Ju.,Discrete programming, Nauka, Moscow, 1969 (in Russian).Google Scholar
  9. [9]
    Saito, T.,Note on archimedean property in an ordered semigroup, Proc. Japan Acad. 46 (1970), 64–65; Bull. Tokyo Gakugei Univ. 22(1970), 8–12.Google Scholar
  10. [10]
    Shapiro, D.,Algorithms for the solution of the optimal cost traveling salesman problem, Sc. D. Thesis, Washington University, St. Louis, 1966.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1974

Authors and Affiliations

  • E. Ja. Gabovič
    • 1
  1. 1.Moscow, M-519USSR

Personalised recommendations