scientific article; zbMATH DE number 3989105

MaRDI QIDQ3751375zbMATH OpenFDO

Authors P. V. Glyakov

Publication date 1983

zbMATH Keywords

partitioning0-1 linear programming

Mathematics Subject Classification ID

Dynamic programming (90C39) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• Least-cost partition algorithms
• scientific article; zbMATH DE number 1046599
• scientific article; zbMATH DE number 3852791
• scientific article; zbMATH DE number 4195735
• scientific article; zbMATH DE number 1559404

Cited in

(6)

• The vectorization of the partition problem
• scientific article; zbMATH DE number 1559404 (Why is no real title available?)
• A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme
• Computing partitions with applications to capital budgeting problems
• ``NP\(=\)P? and restricted partitions
• A dynamic programming approach to the complete set partitioning problem

This page was built for publication:

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