scientific article; zbMATH DE number 3989105

zbMATH Open0611.90075MaRDI QIDQ3751375FDOQ3751375

Authors: P. V. Glyakov 

Publication date: 1983

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

partitioning0-1 linear programming

Mathematics Subject Classification ID

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

Cited In (5)

• A dynamic programming approach to the complete set partitioning problem
• The vectorization of the partition problem
• 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
• ``NP\(=\)P? and restricted partitions
• Title not available (Why is that?)

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)