|
Avtomatika i Telemekhanika, 2008, Issue 12, Pages 53–75
(Mi at764)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Deterministic Systems
New lower bounds for the triplanar assignment problem. Use of the classical model
S. I. Sergeev Moscow State University of Economics, Statistics and Informatics
Abstract:
New sharp lower bounds are suggested for a triplanar assignment problem. They are based on the use of results of the theory of optimal control, the classical formulation of the problem, and represent, in our opinion, the “limit” use of the Hungarian algorithm ideas implemented for the two-index assignment problem.
Citation:
S. I. Sergeev, “New lower bounds for the triplanar assignment problem. Use of the classical model”, Avtomat. i Telemekh., 2008, no. 12, 53–75; Autom. Remote Control, 69:12 (2008), 2039–2060
Linking options:
https://www.mathnet.ru/eng/at764 https://www.mathnet.ru/eng/at/y2008/i12/p53
|
Statistics & downloads: |
Abstract page: | 232 | Full-text PDF : | 72 | References: | 40 | First page: | 2 |
|