Partitioning a finite set by a dynamic programming method

MaRDI QIDQ1883748zbMATH OpenFDO

Authors A. G. Chentsov, P. A. Chentsov

Publication date 13 October 2004

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingoptimal partitioningdiscrete optimization

Mathematics Subject Classification ID

Dynamic programming (90C39) Minimax problems in mathematical programming (90C47) Dynamic programming in optimal control and differential games (49L20)

Recommendations

• scientific article; zbMATH DE number 4195735
• Optimal Set Partitioning
• Combinatorial solution of the partition problem for a discrete set
• scientific article; zbMATH DE number 5379591
• Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets

Cited in

(8)

• Improving dynamic programming strategies for partitioning
• A dynamic programming approach to the complete set partitioning problem
• scientific article; zbMATH DE number 5812481 (Why is no real title available?)
• An algorithm for partitioning a set into simple parts
• An approach to solution of the movements routing problem with several participants
• Job distribution algorithms
• Distribution of assignments among participants under conditions of constraints
• scientific article; zbMATH DE number 1615288 (Why is no real title available?)

This page was built for publication: Partitioning a finite set by a dynamic programming method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883748)