Partitioning a finite set by a dynamic programming method
From MaRDI portal
Publication:1883748
zbMath1062.93021MaRDI QIDQ1883748
A. G. Chentsov, P. A. Chentsov
Publication date: 13 October 2004
Published in: Automation and Remote Control (Search for Journal in Brave)
Minimax problems in mathematical programming (90C47) Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39)
Related Items (3)
An approach to solution of the movements routing problem with several participants ⋮ Job distribution algorithms ⋮ Distribution of assignments among participants under conditions of constraints
This page was built for publication: Partitioning a finite set by a dynamic programming method
