Explicit solution of partitioning problems over a 1-dimensional parameter space

DOI10.1002/1520-6750(200009)47:6%3C531::AID-NAV6%3E3.0.CO;2-KMaRDI QIDQ4519922zbMATH OpenOpenAlexFDO

Authors Shmuel Onn, Uriel G. Rothblum, Frank K. Hwang

Publication date 7 December 2000

Full work available at URL https://doi.org/10.1002/1520-6750(200009)47:6%3C531::aid-nav6%3E3.0.co;2-k

zbMATH Keywords

partitioning problems

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 5379591
• Partitions. Optimality and clustering. Vol. II: Multi-parameter.
• Global solutions of partitioning problems^∗
• The mean-partition problem
• Optimal Set Partitioning

Cited in

(12)

• An efficient algorithm for solving a special case of the generalized problem of stones
• On probabilistic algorithm for solving almost all instances of the set partition problem
• Sphere-separable partitions of multi-parameter elements
• Global solutions of partitioning problems^∗
• A new approach to solve open-partition problems
• Exponentially small bounds on the expected optimum of the partition and subset sum problems
• scientific article; zbMATH DE number 2038186 (Why is no real title available?)
• Computing partitions with applications to capital budgeting problems
• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
• Partition of a set of objects in the problem of the distribution of \(n\) objects between \(n\) participants
• Two-Dimensional partitioning problems
• The mean-partition problem

This page was built for publication: Explicit solution of partitioning problems over a 1-dimensional parameter space

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