Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 1986, Issue 1, Pages 81–89 (Mi at4730)  
Developing Systems

An algorithm for solution of a minimax assignment problem with a sparce initial matrix

M. I. Rubinshtein

Moscow
Full-text PDF (1956 kB)
Abstract: A new method is proposed for solution a minimax assignment problem. A theoretical effort consumption estimate is obtained and compared with the record estimate for available algorithms. Two modifications of this algorithm, important in applications, are provided.

Received: 19.09.1984
Document Type: Article
UDC: 519.283
Language: Russian
Citation: M. I. Rubinshtein, “An algorithm for solution of a minimax assignment problem with a sparce initial matrix”, Avtomat. i Telemekh., 1986, no. 1, 81–89
Citation in format AMSBIB
\Bibitem{Rub86}
\by M.~I.~Rubinshtein
\paper An algorithm for solution of a minimax assignment problem with a sparce initial matrix
\jour Avtomat. i Telemekh.
\yr 1986
\issue 1
\pages 81--89
\mathnet{http://mi.mathnet.ru/at4730}
Linking options:
  • https://www.mathnet.ru/eng/at4730
  • https://www.mathnet.ru/eng/at/y1986/i1/p81
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:116
    Full-text PDF :48
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024