Abstract
This chapter provides a survey on the problem of partitioning points in the d-dimensional space with the goal of maximizing a given objective function; the survey is based on the forthcoming book (Hwang FK, Rothblum UG (2011b) Partitions: optimality and clustering. World Scientific). The first two sections describe the framework, terminology, and some background material that are useful for the analysis of the partition problem. The middle two sections study the case of d = 1, and the last two sections study the case of general d. Results are presented without proofs, but with motivations, comments, and references. Complete proofs can also be found in the forthcoming book.
Work of Uriel G. Rothblum was supported by The Israel Science Foundation (Grant 669/06).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
R.K. Ahuja, J.B. Orlin, A fast and simple algorithm for the maximum flow problem. Oper. Res. 37, 748–759 (1989)
R.K. Ahuja, J.B. Orlin, R.E. Tarjan, Improved time bounds for the maximum flow problem. SIAM J. Comput. 18, 939–954 (1989)
N. Alon, S. Onn, Separable partitions. Discret Appl. Math. 91, 39–51 (1999)
E.R. Barnes, A.J. Hoffman, U.G. Rothblum, Optimal partitions having disjoint convex and conic hulls. Math. Program. 54, 69–86 (1992)
S. Borgwardt, A. Brieden, P. Gritzmann, Constrained minimum-k-star clustering and its application to the consolidation of farmland. Oper. Res. (2009). Published Online First
E. Boros, P.L. Hammer, On clustering problems with connected optima in Euclidean spaces. Discret. Math. 75, 81–88 (1989)
E. Boros, F.K. Hwang, Optimality of nested partitions and its application to cluster analysis. SIAM J. Optim. 6, 1153–1162 (1996)
A. Brieden, P. Gritzmann, A quadratic optimization model for the consolidation of farmland by means of lend-lease agreements, in Operations Research Proceedings 2003: Selected Papers of the International Conferenceon Operations Research (OR2003), ed. by D. Ahr, R. Fahrion, M. Oswarld, G. Reinelt (Springer, Berlin, 2004), pp. 324–331
V. Capoyleas, G. Rote, G. Woeginger, Geometric clusterings. J. Algorithms 12, 341–356 (1991)
A.K. Chakravarty, Multi-item inventory into groups. J. Oper. Res. Soc. U. K. 32, 19–26 (1982)
A.K. Chakravarty, J.B. Orlin, U.G. Rothblum, A partitioning problem with additive objective with an application to optimal inventory grouping for joint replenishment. Oper. Res. 30, 1018–1022 (1982)
A.K. Chakravarty, J.B. Orlin, U.G. Rothblum, Consecutive optimizors for a partitioning problem with applications to optimal inventory groupings for joint replenishment. Oper. Res. 33, 820–834 (1985)
A.K. Chandra, C.K. Wong, Worst case analysis of a placement algorithm related to storage allocation. SIAM J. Comput. 4, 249–263 (1975)
G.J. Chang, F.K. Hwang, Optimality of consecutive and nested tree partitions (1993, preprint) 30, 75–80 (1997)
G.J. Chang, F.L. Chen, L.L. Huang, F.K. Hwang, S.T. Nuan, U.G. Rothblum, I.F. Sun, J.W. Wang, H.G. Yeh, Sortabilities of partition properties. J. Comb. Optim. 2, 413–427 (1999)
R.A. Cody, E.G. Coffman Jr., Record allocation for minimizing expected retrieval costs on drum-like storage devices. J. Assoc. Comput. Mach. 23, 103–115 (1976)
C. Derman, G.J. Lieberman, S.M. Ross, On optimal assembly of systems. Nav. Res. Logist. Q. 19, 564–574 (1972)
R. Dorfman, The detection of defective members of large populations. Ann. Math. Stat. 14, 436–440 (1943)
D.Z. Du, When is a monotonic grouping optimal? in Reliability Theory and Applications, ed. by S. Osaki, J. Cao (World Scientific, River Edge, 1987), pp. 66–76
D.Z. Du, F.K. Hwang, Optimal assembly of an s-stage k-out-of-n system. SIAM J. Disc. Math. 3, 349–354 (1990)
B.C. Eaves, U.G. Rothblum, Relationships between properties of piecewise affine maps over ordered fields. Linear Algebra Appl. 132, 1–63 (1990)
E. El-Neweihi, F. Proschan, J. Sethuraman, Optimal allocation of components in parallel-series and series-parallel systems. J. Appl. Probab. 23, 770–777 (1986)
E. El-Neweihi, F. Proschan, J. Sethuraman, Optimal allocation assembly of systems using Schur functions and majorization. Nav. Res. Logist. Q. 34, 705–712 (1987)
W.D. Fisher, On grouping for maximum homogeneity. J. Am. Stat. Assoc. 53, 789–798 (1958)
S. Fortune, Voronoi diagrams and Delauney triangulations, in Computing in Euclidean Geometry, 2nd edn., ed. by D.Z. Du, F.K. Hwang (World Scientific, Singapore/River Edge, 1995), pp. 193–233
S. Gail, Y. Hollander, A. Attai, Optimal mapping in direct mapped cache environments. Math. Prog. 63, 371–387 (1994)
M.R. Garey, F.K. Hwang, D.S. Johnson, Algorithms for a set partitioning problem arising in the design of multipurpose units. IEEE Trans. Comput. 26, 321–328 (1977)
C.Z. Gilstein, Optimal partitions of finite populations for Dorfman-type group testing. J. Stat. Plan. Inference 12, 385–394 (1985)
B. Golany, F.K. Hwang, U.G. Rothblum, Sphere-separable partitions of multi-parameter elements. Discret. Appl. Math. 156, 838–845 (2008)
S.K. Goyal, Determination of optimum packing frequency of items jointly replenished. Manage. Sci. 21, 436–443 (1974)
R.L. Graham, Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416–429 (1969)
D. Granot, U.G. Rothblum, The Pareto set of the partition bargaining game. Games Econ. Behav. 3, 163–182 (1991)
E.F. Harding, The number of partitions of a set of n points in k dimensions induced by hyperplanes. Proc. Edinb. Math. Soc. 15, 285–289 (1967)
F.K. Hwang, Optimal partitions. J. Optim. Theory Appl. 34, 1–10 (1981)
F.K. Hwang, C.L. Mallows, Enumerating consecutive and nested partitions. J. Comb. Theory A 70, 323–333 (1995)
F.K. Hwang, U.G. Rothblum, Optimality of monotone assemblies for coherent systems composed of series modules. Oper. Res. 42, 709–720 (1994)
F.K. Hwang, U.G. Rothblum, Directional-quasi-convexity, asymmetric Schur-convexity and optimality of consecutive partitions. Math. Oper. Res. 21, 540–554 (1996)
F.K. Hwang, U.G. Rothblum, On the number of separable partitions. J. Combinatorial. Optimization. 21, 423–433 (2011)
F.K. Hwang, U.G. Rothblum, PARTITIONS Optimality and Cluster. Vol. 1: Single-Parameter, World Scientific, Singapore (2012)
F.K. Hwang, U.G. Rothblum, Almost separable partitions (2011, forthcoming)
F.K. Hwang, J. Sun, E.Y. Yao, Optimal set partitioning. SIAM J. Algorithms Discret. Methods 6, 163–170 (1985)
F.K. Hwang, U.G. Rothblum, Y.-C. Yao, Localizing combinatorial properties of partitions. Discret. Math. 160, 1–23 (1996)
F.K. Hwang, S. Onn, U.G. Rothblum, A polynomial time algorithm for shaped partition problems. SIAM J. Optim. 10, 70–81 (1999)
F.K. Hwang, S. Onn, U.G. Rothblum, Linear shaped partition problems. Oper. Res. Lett. 26, 159–163 (2000)
F.K. Hwang, J.S. Lee, Y.C. Liu, U.G. Rothblum, Sortability of vector partitions. Discret. Math. 263, 129–142 (2003)
F.K. Hwang, J.S. Lee, U.G. Rothblum, Permutation polytopes corresponding to strongly supermodular functions. Discret. Appl. Math. 142, 87–97 (2004)
U.R. Kodes, Partitioning and card selection, in Design Automation of Digital Systems, vol. 1, ed. by M.A. Breuer (Prentice Hall, Englewood Cliffs, 1972)
G. Kreweras, Sur le partitions non crois\(\acute{\mbox{ e}}\)es d’un cycle. Discret. Math. 1, 333–350 (1972)
D.M. Malon, When is greedy module assembly optimal. Nav. Res. Logist. Q. 37, 847–854 (1990)
A.W. Marshall, I. Olkin, Inequalities, Theory of Majorization and Its Applications (Academic, New York, 1979)
S. Mehta, R. Chandraseckaran, H. Emmons, Order-preserving allocation of jobs to two machines. Nav. Res. Logist. Q. 21, 361–374 (1974)
O. Morgenstern, J. Von Neumann, Theory of Games and Economic Behavior (Princetona University Press, Princeton, 1944) (A translation of a German 1928 text)
W.M. Nawijn, Optimizing the performance of a blood analyser: application of the set partitioning problem. Eur. J. Oper. Res. 36, 167–173 (1988)
J. Neyman, E. Pearson, On the problem of the most efficient tests of statistical hypotheses. Philos. Trans. R. Soc. Lond. A 231, 289–337 (1933)
D. Nocturne, Economic order frequency for several items jointly replenished. Manage. Sci. 19, 1093–1096 (1973)
K.N. Oikonomou, Abstractions of finite-state machines optimal with respect to single undetectable output faults. IEEE Trans. Comput. 36, 185–200 (1987)
K.N. Oikonomou, Abstractions of finite-state machines and immediately-detectable output faults. IEEE Trans. Comput. 41, 325–338 (1992)
K.N. Oikonomou, R.Y. Kain, Abstractions for node-level passive fault detection in distributed systems. IEEE Trans. Comput. C-32, 543–550 (1983)
C.G. Pfeifer, P. Enis, Dorfman-type group testing for a modified binomial model. J. Am. Stat. Assoc. 73, 588–592 (1978)
U. Pfersky, R. Rudolf, G. Woeginger, Some geometric clustering problems. Nord. J. Comput. 1, 246–263 (1994)
T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, 1970)
M.H. Rothkopf, A note on allocating jobs to two machines. Nav. Res. Logist. Q. 22, 829–830 (1975)
P.H. Schoute, Analytic treatment of the polytope regularly derived from the regular polytopes. Verhandelingen der Koningklijke Akademie van Wetenschappen te Amsterdam 11(3), 87p. (1911). Johannes Müller, Amsterdam
A. Schrijver, Theory of Linear and Integer Programming (Wiley, New York, 1986)
M. Shamos, D. Hoey, Closest-point problems, in Proceedings of the 16th Annual Symposium on Foundations of Computer Science (1975), pp. 151–162
L.S. Shapley, Cores of convex games. Int. J. Game Theory 1, 11–26 (1971)
E.A. Silver, A simple method of determining order quantities in joint replenishments under deterministic demands. Manage. Sci. 22, 1351–1361 (1976)
M. Sobel, P.A. Groll, Group testing to eliminate efficient all detectives in a binomial sample. Bell Syst. Tech. J. 38, 1179–1252 (1959)
V.S. Tanaev, Optimal subdivision of finite sets into subsets. Akad. Nauk BSSR Dokl. 23, 26–28 (1979)
F. Tardella, On the equivalence between some discrete and continuous optimization problems. Ann. Oper. Res. 2, 291–300 (1990)
G.M. Ziegler, Graduate Texts in Mathematics. Lecture Notes on Polytopes (Springer, New York, 1995)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this entry
Cite this entry
Hwang, F.K., Rothblum, U.G. (2013). Optimal Partitions. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_40
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7997-1_40
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7996-4
Online ISBN: 978-1-4419-7997-1
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering