scientific article; zbMATH DE number 1472145

MaRDI QIDQ4489196zbMATH OpenFDO

Authors Robert R. Goldberg, Jacob Shapiro, Jerry Waxman

Publication date 17 January 2001

zbMATH Keywords

Lagrange multipliersNP-completepartition of a setperfectly fit partitionvariance

Mathematics Subject Classification ID

Partitions of sets (05A18) Analysis of algorithms and problem complexity (68Q25) Quadratic programming (90C20)

Recommendations

• A tight upper bound for the \(k\)-partition problem on ideal sets
• Partitioning under the \(L_p\) norm
• Partitioning ideal sets
• A complete anytime algorithm for number partitioning
• scientific article; zbMATH DE number 1185313

Cited in

(4)

• Partitioning under the \(L_p\) norm
• Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
• Worst-case analysis of the differencing method for the partition problem
• Probabilistic analysis of the number 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 Q4489196)