Abstract
The vector partition problem concerns the partitioning of a set A of n vectors in d-space into p parts so as to maximize an objective function c which is convex on the sum of vectors in each part. Here all parameters d, p, n are considered variables. In this paper, we study the adjacency of vertices in the associated partition polytopes. Using our adjacency characterization for these polytopes, we are able to develop an adaptive algorithm for the vector partition problem that runs in time O(q(L)ċv) and in space O(L), where q is a polynomial function, L is the input size and v is the number of vertices of the associated partition polytope. It is based on an output-sensitive algorithm for enumerating all vertices of the partition polytope. Our adjacency characterization also implies a polynomial upper bound on the combinatorial diameter of partition polytopes. We also establish a partition polytope analogue of the lower bound theorem, indicating that the output-sensitive enumeration algorithm can be far superior to previously known algorithms that run in time polynomial in the size of the worst-case output.
Similar content being viewed by others
References
Alon, N. and Onn, S. (1999), Separable partitions, Discrete Applied Mathematics 91, 39-51.
Andrzejak, A. and Fukuda, K. (1999), Optimization over k-set polytopes and efficient k-set enumeration, In: Proc. 6th International Workshop on Algorithms and Data Structures (WADS'99), LNCS 1663, p. 1-12. Springer, Berlin.
Aviran, S. and Onn, S. (2002), Momentopes and the vertex complexity of partition polytopes, Discrete and Computational Geometry 27, 409-417.
Avis, D. and Fukuda, K. (1992), A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete and Computational Geometry 8, 295-313.
Avis, D. and Fukuda, K. (1996), Reverse search for enumeration, Discrete Applied Mathematics 65, 21-46.
Bland, R.G. (1977) New finite pivot rules for the simplex method, Mathematics of Operations Research 2, 103-107.
Barnes, E.R., Hoffman, A.J. and Rothblum, U.G. (1992), Optimal partitions having disjoint convex and conic hulls, Mathematical Programming, 54, 69-86.
Chvátal, V. (1983), Linear Programming, W.H.Freeman and Company, New York.
Granot, D. and Rothblum, U.G. (1991), The Pareto set of the partition bargaining game, Games and Economic Behavior 3, 163-182.
Hwang, F.K., Onn, S. and Rothblum, U.G. (1999), A polynomial time algorithm for shaped partition problems, SIAM Journal on Optimization 10, 70-81.
Hwang, F.K., Onn, S. and Rothblum, U.G. (2000), Linear-shaped partition problems, Operations Research Letters 26, 159-163.
Onn, S. and Schulman, L.J. (2001), The vector partition problem for convex objective functions, Mathematics of Operations Research 26, 583-590.
Onn, S. and Sturmfels, B. (1999), Cutting corners, Advances in Applied Mathematics, 23, 29-48.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fukuda, K., Onn, S. & Rosta, V. An Adaptive Algorithm for Vector Partitioning. Journal of Global Optimization 25, 305–319 (2003). https://doi.org/10.1023/A:1022417803474
Issue Date:
DOI: https://doi.org/10.1023/A:1022417803474