scientific article; zbMATH DE number 1472145

zbMATH Open0952.05004MaRDI QIDQ4489196FDOQ4489196

Authors: Robert R. Goldberg, Jacob Shapiro, Jerry Waxman 

Publication date: 17 January 2001

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

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

zbMATH Keywords

varianceLagrange multipliersNP-completepartition of a setperfectly fit partition

Mathematics Subject Classification ID

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

Cited In (4)

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