The Vector Partition Problem for Convex Objective Functions

References

• Alon N., Onn S. Separable partitions. Disc. App. Math. (1999) 91:39–51Crossref, Google Scholar
• Aviran S., Lev-Tov N., Onn S., Rothblum U. G. Vertex characterization of partition polytopes of bipartitions and of planar point sets. Disc. App. Math. (2000) Google Scholar
• Barnes E. R., Hoffman A. J., Rothblum U. G. Optimal partitions having disjoint convex and conic hulls. Math. Prog. (1992) 54:69–86Crossref, Google Scholar
• Granot D., Rothblum U. G. The Pareto set of the partition bargaining game. Games Econom. Behav. (1991) 3:163–182Crossref, Google Scholar
• Gritzmann P., Sturmfels B. Minkowski addition of polytopes: computational complexity and applications to Gröbner bases. SIAM J. Disc. Math. (1993) 6:246–269Crossref, Google Scholar
• Grünbaum B.Convex Polytopes (1967) (Wiley-Interscience, London, U.K.) Google Scholar
• Hwang F. K., Onn S., Rothblum U. G. Linear shaped partition problems. Oper. Res. Lett. (2000) 26:159–163Crossref, Google Scholar
• Hwang F. K., Onn S., Rothblum U. G. A polynomial time algorithm for shaped partition problems. SIAM J. Optim. (1999) 10:70–81Crossref, Google Scholar
• Onn S., Sturmfels B. Cutting corners. Adv. App. Math. (1999) 23:29–48Crossref, Google Scholar