Abstract
The deterministic variant of the dynamic assignment problem is considered. The task of finding the path of maximum cost is investigated. Examples of solution the dynamic assignment problem and solving the problem of finding the path of maximum cost are given.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.