Abstract
We discuss a mixed-integer nonlinear programming formulation for the problem of covering a set of points with a given number of slabs of minimum width, known as the bottleneck variant of the hyperplane clustering problem. We derive several linear approximations, which we solve using a standard mixed-integer linear programming solver. A computational comparison of the performance of the different linearizations is provided.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Procopiuc, C.M.: Approximation algorithms for projective clustering. Journal of Algorithms 46, 115–139 (2003)
Amaldi, E., Ceselli, A., Dhyani, K.: Column generation for the min-hyperplane clustering problem. In: 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (2008)
Asuncion, A., Newman, D.J.: UCI machine learning repository, University of California, Irvine, School of Information and Computer Sciences (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Bradley, P.S., Mangasarian, O.L.: k-Plane clustering. J. of Global Optimization 16(1), 23–32 (2000)
Coniglio, S., Italiano, F.: Hyperplane clustering and piecewise linear model fitting. Master’s thesis, DEI, Politecnico di Milano (2007)
Har-Peled, S.: No coreset, no cry. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 324–335. Springer, Heidelberg (2004)
ILOG. ILOG CPLEX 11.0 User’s Manual. ILOG S.A, Gentilly, France (2008)
Langerman, S., Morin, P.: Covering things with things. Discrete Computational Geometry 33(4), 717–729 (2005)
Liberti, L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, pp. 211–262. Springer, Berlin (2006)
Liberti, L.: Reformulation techniques in mathematical programming, Thèse d’Habilitation à Diriger des Recherches (November 2007)
Liberti, L.: Reformulations in mathematical programming: Definitions. In: Aringhieri, R., Cordone, R., Righini, G. (eds.) Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Crema, pp. 66–70. Università Statale di Milano (2008)
Liberti, L., Mladenović, N., Nannicini, G.: A good recipe for solving MINLPs. In: Maniezzo, V. (ed.) Proceedings of Matheuristics 2008 Conference, Bertinoro (2008)
Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Operations Research Letters 1, 194–197 (1982)
Mishra, N., Motwani, R., Vassilvitskii, S.: Sublinear projective clustering with outliers. In: 15th Annual Fall Workshop on Computational Geometry and Visualization (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dhyani, K., Liberti, L. (2008). Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-87477-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87476-8
Online ISBN: 978-3-540-87477-5
eBook Packages: Computer ScienceComputer Science (R0)